STACS 99

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.

[1]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2]  J. Nielsen,et al.  Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden , 1917 .

[3]  Anca Muscholl,et al.  Solving Trace Equations Using Lexicographical Normal Forms , 1997, ICALP.

[4]  Klaus U. Schulz.  Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.

[5]  Klaus W. Wagner.  A Note on Parallel Queries and the Symmetric-Difference Hierarchy , 1998, Inf. Process. Lett..

[6]  Joxan Jaffar.  Minimal and complete word unification , 1990, JACM.

[7]  R. Lyndon.  Equations in free groups , 1960 .

[8]  Yuri V. Matiyasevich.  Some Decision Problems for Traces , 1997, LFCS.

[9]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[10]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[11]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Victor L. Selivanov.  Fine Hierarchies and Boolean Terms , 1995, J. Symb. Log..

[13]  Wojciech Plandowski,et al.  Application of Lempel-Ziv Encodings to the Solution of Words Equations , 1998, ICALP.

[14]  Christian Choffrut,et al.  Combinatorics of Words , 1997, Handbook of Formal Languages.

[15]  Claudio Gutiérrez.  Satisfiability of word equations with constants is in exponential space , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[16]  Leszek Pacholski,et al.  Complexity of Makanin's algorithm , 1996, JACM.

[17]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .