Algorithms for selfish agents: mechanism design for distributed computation

Noam Nisan

doi:10.1007/3-540-49116-3_1

Algorithms for selfish agents: mechanism design for distributed computation

Noam Nisan^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

42 Scopus citations

Abstract

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	English
Title of host publication	STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Editors	Christoph Meinel, Sophie Tison
Publisher	Springer Verlag
Pages	1-15
Number of pages	15
ISBN (Print)	354065691X, 9783540656913
DOIs	https://doi.org/10.1007/3-540-49116-3_1
State	Published - 1999
Event	16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999 - Trier, Germany Duration: 4 Mar 1999 → 6 Mar 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1563
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999
Country/Territory	Germany
City	Trier
Period	4/03/99 → 6/03/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Access to Document

10.1007/3-540-49116-3_1

Cite this

Nisan, N. (1999). Algorithms for selfish agents: mechanism design for distributed computation. In C. Meinel, & S. Tison (Eds.), STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp. 1-15). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1563). Springer Verlag. https://doi.org/10.1007/3-540-49116-3_1

Nisan, Noam. / Algorithms for selfish agents : mechanism design for distributed computation. STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. editor / Christoph Meinel ; Sophie Tison. Springer Verlag, 1999. pp. 1-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ff0413454e7049de8412fd0bb793190b,

title = "Algorithms for selfish agents: mechanism design for distributed computation",

abstract = "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.",

author = "Noam Nisan",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999 ; Conference date: 04-03-1999 Through 06-03-1999",

year = "1999",

doi = "10.1007/3-540-49116-3_1",

language = "אנגלית",

isbn = "354065691X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--15",

editor = "Christoph Meinel and Sophie Tison",

booktitle = "STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",

address = "גרמניה",

}

Nisan, N 1999, Algorithms for selfish agents: mechanism design for distributed computation. in C Meinel & S Tison (eds), STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1563, Springer Verlag, pp. 1-15, 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999, Trier, Germany, 4/03/99. https://doi.org/10.1007/3-540-49116-3_1

Algorithms for selfish agents: mechanism design for distributed computation. / Nisan, Noam.
STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. ed. / Christoph Meinel; Sophie Tison. Springer Verlag, 1999. p. 1-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1563).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithms for selfish agents

T2 - 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999

AU - Nisan, Noam

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957082944&partnerID=8YFLogxK

U2 - 10.1007/3-540-49116-3_1

DO - 10.1007/3-540-49116-3_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957082944

SN - 354065691X

SN - 9783540656913

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 15

BT - STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

A2 - Meinel, Christoph

A2 - Tison, Sophie

PB - Springer Verlag

Y2 - 4 March 1999 through 6 March 1999

ER -

Nisan N. Algorithms for selfish agents: mechanism design for distributed computation. In Meinel C, Tison S, editors, STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag. 1999. p. 1-15. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-49116-3_1

Algorithms for selfish agents: mechanism design for distributed computation

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this