Abstract
We examine the relation between the size of the id space and the number of rational agents in a network under which equilibrium in distributed algorithms is possible. When the number of agents in the network is not a-priori known, but the id space is limited, a single agent may duplicate to gain an advantage but each duplication involves a risk of being caught. Given an id space of size L, we provide a method of calculating the threshold, the minimal value t such that agents know that \(n \ge t\), such that the algorithm is in equilibrium. We apply the method to Leader Election and Knowledge Sharing, and provide a constant-time approximation \(t \approx \frac{L}{5}\) of the threshold for Leader Election.
This research was supported by the Israel Science Foundation (grant 1386/11).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abraham, I., Alvisi, L., Halpern, J.Y.: Distributed computing meets game theory: combining insights from two fields. SIGACT News 42(2), 69–76 (2011). https://doi.org/10.1145/1998037.1998055
Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC, pp. 53–62 (2006)
Abraham, I., Dolev, D., Halpern, J.Y.: Distributed protocols for leader election: a game-theoretic perspective. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 61–75. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41527-2_5
Afek, Y., Rafaeli, S., Sulamy, M.: Cheating by duplication: equilibrium requires global knowledge. ArXiv e-prints, November 2017
Afek, Y., Ginzberg, Y., Landau Feibish, S., Sulamy, M.: Distributed computing building blocks for rational agents. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014, pp. 406–415. ACM, New York (2014). https://doi.org/10.1145/2611462.2611481
Bank, D., Sulamy, M., Waserman, E.: Reaching distributed equilibrium with limited ID space. ArXiv e-prints, April 2018
Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45748-8_24
Halpern, J.Y., Vilaça, X.: Rational consensus: extended abstract. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, pp. 137–146. ACM, New York (2016). https://doi.org/10.1145/2933057.2933088
Yifrach, A., Mansour, Y.: Fair leader election for rational agents. In: PODC 2018 (2018)
Acknowledgment
We would like to thank Yehuda Afek for helpful discussions and his course on Distributed Computing which has inspired this research, and to Sivan Schick for his contributions to this paper.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Bank, D., Sulamy, M., Waserman, E. (2018). Reaching Distributed Equilibrium with Limited ID Space. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)