Advertisement

Fault Tolerance in Distributed Mechanism Design

  • Ronen Gradwohl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5385)

Abstract

We argue that in distributed mechanism design frameworks it is important to consider not only rational manipulation by players, but also malicious, faulty behavior. To this end, we show that in some instances it is possible to take a centralized mechanism and implement it in a distributed setting in a fault tolerant manner. More specifically, we examine two distinct models of distributed mechanism design – a Nash implementation with the planner as a node on the network, and an ex post Nash implementation with the planner only acting as a “bank”. For each model we show that the implementation can be made resilient to faults.

Keywords

Nash Equilibrium Fault Tolerance Byzantine Agreement Faulty Behavior Nash Implementation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aiyer, A., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: BAR fault tolerance for cooperative services. In: Proceedings of 20th ACM Symposium on Operating Systems Principles, pp. 45–58 (2005)Google Scholar
  2. 2.
    Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 53–62 (2006)Google Scholar
  3. 3.
    Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games IV. Annals of Mathematical Studies, pp. 287–324 (1959)Google Scholar
  4. 4.
    Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of the ACM 40(1), 17–47 (1997)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Eliaz, K.: Fault-tolerant implementation. Review of Economic Studies 69(3), 589–610 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873–933 (1997)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distributed Computing 18, 61–702 (2005)CrossRefMATHGoogle Scholar
  8. 8.
    Feigenbaum, J., Schapira, M., Shenker, S.: Distributed algorithmic mechanism design. In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2008)Google Scholar
  9. 9.
    Feigenbaum, J., Shenker, S.: Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. In: 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1–13 (2002)Google Scholar
  10. 10.
    Goldwasser, S., Pavlov, E., Vaikuntanathan, V.: Fault-tolerant distributed computing in full-information networks. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (2006)Google Scholar
  11. 11.
    Gradwohl, R.: Fault tolerance in distributed mechanism design (manuscript), http://www.wisdom.weizmann.ac.il/~rgradwoh/files/ft-mech.pdf
  12. 12.
    Halpern, J.: A computer scientist looks at game theory. Games and Economic Behavior 45(1), 114–131 (2003)CrossRefMATHGoogle Scholar
  13. 13.
    Halpern, J.: Computer science and game theory: A brief survey. In: The New Palgrave Dictionary of Economics (to appear)Google Scholar
  14. 14.
    Karlin, A., Yao, A.: Probabilistic lower bounds for byzantine agreeement (manuscript, 1986)Google Scholar
  15. 15.
    Monderer, D., Tennenholtz, M.: Distributed games: from mechanisms to protocols. In: AAAI, pp. 32–37 (1999)Google Scholar
  16. 16.
    Petcu, A., Faltings, B., Parkes, D.: MDPOP: Faithful distributed implementation of efficient social choice problems. In: AAMAS (2006)Google Scholar
  17. 17.
    Parkes, D., Shneidman, J.: Distributed implementation of Vickrey-Clarke-Groves mechanisms. In: AAMAS (2004)Google Scholar
  18. 18.
    Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27, 228–234 (1980)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Shneidman, J., Parkes, D.: Specification faithfulness in networks with rational nodes. In: PODC 2004 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ronen Gradwohl
    • 1
  1. 1.Department of Computer Science and Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations