Algorithms for Selfish Agents

Mechanism Design for Distributed Computation
  • Noam Nisan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1563)


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.


Short Path Mechanism Design Dominant Strategy Combinatorial Auction Price Auction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Comet group technical reports. Web Page:
  2. [2]
    The information economy. Web Page:
  3. [3]
    Market-oriented programming. Web Page:
  4. [4]
    First international conference on information and computation economies ice-98. Web Page:, October 1998.
  5. [5]
    E. H. Clarke. Multipart pricing of public goods. Public Choice, pages 17–33, 1971.Google Scholar
  6. [6]
    C. Crepeau D. Chaum and I. Damgard. Multiparty unconditionally secure protocols. In 20th STOC, 1988.Google Scholar
  7. [7]
    Eithan Ephrati and Jeffrey S. Rosenschein. The clarke tax as a concensus mechanism among automated agents. In Proceedings of the national Conference on Artificial Intelligence, pages 173–178, July 1991.Google Scholar
  8. [8]
    Donald F. Ferguson, Christos Nikolaou, and Yechiam Yemini. Economic models for allocating resources in computer systems. In Scott Clearwater, editor, Market-Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, 1995.Google Scholar
  9. [9]
    J. Green and J.J. Laffont. Characterization of satisfactory mechanism for the revelation of preferences for public goods. Econometrica, pages 427–438, 1977.Google Scholar
  10. [10]
    T. Groves. Incentives in teams. Econometrica, pages 617–631, 1973.Google Scholar
  11. [11]
    Y.A Korilis, A. A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal on Selected Areas in Communication Special Issue on Advances in the Fundamentals of Networking), 13(7):1241–1251, September 1991.Google Scholar
  12. [12]
    A.A. Lazar and N. Semret. The progressive second price auction mechanism for network resource sharing. In 8th International Symposium on Dynamic Games, Maastricht, The Netherlands, July 1998.Google Scholar
  13. [13]
    Nathan Lineal. Game theoretic aspects of computing. In Handbook of Game Theory, volume 2, pages 1339–1395. Elsevier Science Publishers B.V, 1994.CrossRefGoogle Scholar
  14. [14]
    S. Golwasser M. Ben-Or and A. Wigderson. Completeness theorems for faulttaulerent distributed computing. In 20th STOC, 1988.Google Scholar
  15. [15]
    A. Mas-Collel, W. Whinston, and J. Green. Microeconomic Theory. Oxford university press, 1995.Google Scholar
  16. [16]
    J. McMillan. Selling spectrum rights. Journal of Economic Perspectives, pages 145–162, 1994.Google Scholar
  17. [17]
    Market design inc. Web Page:
  18. [18]
    Noam Nisan and Amir Ronen. Algorithmic mechanism design. Avilable at
  19. [19]
    S. Micali O. Goldreich and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In 27th FOCS, 1986.Google Scholar
  20. [20]
    M. J. Osborne and A. Rubistein. A Course in Game Theory. MIT press, 1994.Google Scholar
  21. [21]
    Jeffrey S. Rosenschein and Gilad Zlotkin. Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. MIT Press, 1994.Google Scholar
  22. [22]
    Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multi-agent Systems (ICMAS-96), pages 299–306, Keihanna Plaza, Kyoto, Japan, December 1996.Google Scholar
  23. [23]
    S. Shenkar, Clark D. E., and Hertzog S. Pricing in computer networks: Reshaping the research agenda. ACM Computational Comm. Review, pages 19–43, 1996.Google Scholar
  24. [24]
    W. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, pages 8–37, 1961.Google Scholar
  25. [25]
    W.E. Walsh and M.P. Wellman. A market protocol for decentralized task allocation: Extended version. In The Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS-98), 1998.Google Scholar
  26. [26]
    W.E. Walsh, M.P. Wellman, P.R. Wurman, and J.K. MacKie-Mason. Auction protocols for decentralized scheduling. In Proceedings of The Eighteenth International Conference on Distributed Computing Systems (ICDCS-98), Amsterdam, The Netherlands, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Noam Nisan
    • 1
    • 2
  1. 1.Institute of Computer ScienceHebrew U.Jerusalem
  2. 2.IDCHerzliya

Personalised recommendations