Reputation design for adaptive networks with selfish agents
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. To cope with misbehavior in such self-organized networks, nodes need to be able to automatically adapt their strategy ...
Despite the rigour and ability of game theory to cope with oligopolistic electric markets, it fails to model many existing behaviours in the real-world circumstances. The traditional models such as statistical extrapolation or econometrics are not capable ...
In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward corr ...
Reputation mechanisms offer an efficient way of building the necessary level of trust in electronic markets. In the absence of independent verification authorities that can reveal the true outcome of a ransaction, market designers have to insure that it is ...
This paper discusses some issues for animating virtual characters. It emphasizes the duality between control and autonomy. Specific problems and examples are addressed like generic motion engine, environment-based motion control, autonomous behaviors, and ...
Trust and reputation systems have proven to be essential to enforcing cooperative behavior in peer-to-peer networks. We briefly describe the current approaches to building reputation systems: social networks formation, probabilistic estimation and game the ...
In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward corr ...
Choosing the best out of an increasing number of options requires reliable and accurate information. As our time and resources are limited, we commonly use the experience of others in order to take decisions. Reputation mechanisms aggregate in a formal way ...
Ecole Polytechnique Fédérale de Lausanne (EPFL)2005
Reputation systems offer a viable solution to the old problem of encouraging trustworthy behavior in online communities. Their key presumptions are that the participants of an online community engage in repeated interactions and that the information about ...
Mobile ad-hoc networks rely on the cooperation of nodes for routing and forwarding. For individual nodes there are however several advantages resulting from noncooperation, the most obvious being power saving. Nodes that act selfishly or even maliciously p ...
