This paper considers algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. Such scenarios arise, in particular, when computers or users aim to cooperate or trade over the Internet. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents' interests are best served by behaving correctly. This exposition presents a model to formally study such algorithms. This model, based on the field of mechanism design, is taken from the author's joint work with Amir Ronen, and is similar to approaches taken in the distributed AI community in recent years. Using this model, we demonstrate how some of the techniques of mechanism design can be applied towards distributed computation problems. We then exhibit some issues that arise in distributed computation which require going beyond the existing theory of mechanism design.
|Original language||American English|
|Title of host publication||STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings|
|Editors||Christoph Meinel, Sophie Tison|
|Number of pages||15|
|ISBN (Print)||354065691X, 9783540656913|
|State||Published - 1999|
|Event||16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999 - Trier, Germany|
Duration: 4 Mar 1999 → 6 Mar 1999
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999|
|Period||4/03/99 → 6/03/99|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.