Skip to main content
SpringerLink
Log in

Fault Tolerance in Distributed Mechanism Design

  • Conference paper
Book cover Internet and Network Economics (WINE 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5385))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of the ACM 40(1), 17–47 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Eliaz, K.: Fault-tolerant implementation. Review of Economic Studies 69(3), 589–610 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873–933 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distributed Computing 18, 61–702 (2005)

    Article  MATH  Google Scholar 

  8. Feigenbaum, J., Schapira, M., Shenker, S.: Distributed algorithmic mechanism design. In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2008)

    Google Scholar 

  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. 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. Gradwohl, R.: Fault tolerance in distributed mechanism design (manuscript), http://www.wisdom.weizmann.ac.il/~rgradwoh/files/ft-mech.pdf

  12. Halpern, J.: A computer scientist looks at game theory. Games and Economic Behavior 45(1), 114–131 (2003)

    Article  MATH  Google Scholar 

  13. Halpern, J.: Computer science and game theory: A brief survey. In: The New Palgrave Dictionary of Economics (to appear)

    Google Scholar 

  14. Karlin, A., Yao, A.: Probabilistic lower bounds for byzantine agreeement (manuscript, 1986)

    Google Scholar 

  15. Monderer, D., Tennenholtz, M.: Distributed games: from mechanisms to protocols. In: AAAI, pp. 32–37 (1999)

    Google Scholar 

  16. Petcu, A., Faltings, B., Parkes, D.: MDPOP: Faithful distributed implementation of efficient social choice problems. In: AAMAS (2006)

    Google Scholar 

  17. Parkes, D., Shneidman, J.: Distributed implementation of Vickrey-Clarke-Groves mechanisms. In: AAMAS (2004)

    Google Scholar 

  18. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27, 228–234 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  19. Shneidman, J., Parkes, D.: Specification faithfulness in networks with rational nodes. In: PODC 2004 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100, Israel

    Ronen Gradwohl

Authors
  1. Ronen Gradwohl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Division, University of California at Berkeley, Berkeley, CA, USA

    Christos Papadimitriou

  2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Shuzhong Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gradwohl, R. (2008). Fault Tolerance in Distributed Mechanism Design. In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92185-1_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92184-4

  • Online ISBN: 978-3-540-92185-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation