{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:03Z","timestamp":1763468163179},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_5","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"61-75","source":"Crossref","is-referenced-by-count":20,"title":["Distributed Protocols for Leader Election: A Game-Theoretic Perspective"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proc.\u00a025th ACM Symp. Principles of Distributed Computing, pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-78524-8_17","volume-title":"Theory of Cryptography","author":"I. Abraham","year":"2008","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: Lower bounds on implementing robust and resilient mediators. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 302\u2013319. Springer, Heidelberg (2008)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: BAR fault tolerance for cooperative services. In: Proc.\u00a020th ACM Symp. Operating Systems Principles (SOSP 2005), pp. 45\u201358 (2005)","DOI":"10.1145\/1095809.1095816"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/moor.17.2.327","volume":"17","author":"I. Barany","year":"1992","unstructured":"Barany, I.: Fair distribution protocols or how the players replace fortune. Mathematics of Operations Research\u00a017, 327\u2013340 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc.\u00a020th ACM Symp.\u00a0Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0022-0531(02)00011-X","volume":"108","author":"E. Ben-Porath","year":"2003","unstructured":"Ben-Porath, E.: Cheap talk in games with incomplete information. Journal of Economic Theory\u00a0108(1), 45\u201371 (2003)","journal-title":"Journal of Economic Theory"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M. Blum","year":"1983","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News\u00a015, 23\u201327 (1983)","journal-title":"SIGACT News"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Boppana, R.B., Narayanan, B.O.: Perfect-information leader election with optimal resilience. SIAM Journal on Computing, 1304\u20131320 (2000)","DOI":"10.1137\/S0097539796307182"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E. Chang","year":"1979","unstructured":"Chang, E., Roberts, R.: An improved algorithm for decentralized extrema-finding in circular configurations of processes. Communications of the ACM\u00a022(5), 281\u2013283 (1979)","journal-title":"Communications of the ACM"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Dani, V., Movahedi, M., Rodriguez, Y., Saia, J.: Scalable rational secret sharing. In: Proc.\u00a030th ACM Symp. Principles of Distributed Computing, pp. 187\u2013196 (2011)","DOI":"10.1145\/1993806.1993833"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. Journal of Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Klawe, M., Rodeh, M.: An o(n logn) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms\u00a03(3), 245\u2013260 (1982)","journal-title":"Journal of Algorithms"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing\u00a026, 873\u2013933 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.2307\/2938319","volume":"58","author":"F. Forges","year":"1990","unstructured":"Forges, F.: Universal mechanisms. Econometrica\u00a058(6), 1341\u20131364 (1990)","journal-title":"Econometrica"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-11799-2_25","volume-title":"Theory of Cryptography","author":"G. Fuchsbauer","year":"2010","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient rational secret sharing in standard communication networks. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 419\u2013436. Springer, Heidelberg (2010)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Gordon, D., Katz, J.: Rational secret sharing, revisited. In: SCN (Security in Communication Networks) 2006, pp. 229\u2013241 (2006)","DOI":"10.1007\/11832072_16"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Proc.\u00a036th ACM Symp. Theory of Computing, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"5_CR20","unstructured":"Heller, Y.: A minority-proof cheap-talk protocol (2005) (unpublished manuscript)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.geb.2010.05.003","volume":"71","author":"S. Izmalkov","year":"2011","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Perfect implementation. Games and Economic Behavior\u00a071, 121\u2013140 (2011)","journal-title":"Games and Economic Behavior"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On Expected Constant-Round Protocols for Byzantine Agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 445\u2013462. Springer, Heidelberg (2006)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"863","DOI":"10.2307\/1912767","volume":"50","author":"D.M. Kreps","year":"1982","unstructured":"Kreps, D.M., Wilson, R.B.: Sequential equilibria. Econometrica\u00a050, 863\u2013894 (1982)","journal-title":"Econometrica"},{"key":"5_CR24","unstructured":"Le Lann, G.: Distributed systems\u2014towards a formal approach. In: IFIP Congress, vol.\u00a07, pp. 155\u2013160 (1977)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: Proc.\u00a023rd ACM Symp. on Principles of Distributed Computing, pp. 1\u201310 (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"5_CR26","unstructured":"Lin, H., Pass, R.: Constant-round non-malleable commitments from any one-way function. In: Proc.\u00a021st International Joint Conf. on Artificial Intelligence (IJCAI 2009), pp. 153\u2013158 (2009)"},{"key":"5_CR27","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1997","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11818175_11","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A. Lysyanskaya","year":"2006","unstructured":"Lysyanskaya, A., Triandopoulos, N.: Rationality and adversarial behavior in multi-party computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 180\u2013197. Springer, Heidelberg (2006)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"McGrew, R., Porter, R., Shoham, Y.: Towards a general theory of non-cooperative computing. In: Theoretical Aspects of Rationality and Knowledge: Proc.\u00a0Ninth Conf. (TARK 2003), pp. 59\u201351 (2003)","DOI":"10.1145\/846241.846249"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: Byzantine players in a virus inoculation game. In: Proc.\u00a025th ACM Symp. Principles of Distributed Computing, pp. 35\u201344 (2006)","DOI":"10.1145\/1146381.1146391"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04, 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"5_CR32","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"Peterson, G.L.: An O(nlogn) unidirectional distributed algorithm for the circular extrema problem. ACM Trans. Progr. Lang. Syst.\u00a04(4), 758\u2013762 (1982)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Saks, M.E.: A robust noncryptographic protocol for collective coin flipping. SIAM Journal on Discrete Mathemantics, 240\u2013244 (1989)","DOI":"10.1137\/0402020"},{"issue":"1-2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2005.05.009","volume":"343","author":"Y. Shoham","year":"2005","unstructured":"Shoham, Y., Tennenholtz, M.: Non-cooperative computing: Boolean functions with correctness and exclusivity. Theoretical Computer Science\u00a0343(1-2), 97\u2013113 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"5_CR35","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1111\/1468-0262.00357","volume":"70","author":"A. Urbano","year":"2002","unstructured":"Urbano, A., Vila, J.E.: Computational complexity and communication: coordination in two-player games. Econometrica\u00a070(5), 1893\u20131927 (2002)","journal-title":"Econometrica"},{"issue":"2","key":"5_CR36","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00199-003-0378-z","volume":"23","author":"A. Urbano","year":"2004","unstructured":"Urbano, A., Vila, J.E.: Computationally restricted unmediated talk under incomplete information. Economic Theory\u00a023(2), 283\u2013320 (2004)","journal-title":"Economic Theory"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-25873-2_7","volume-title":"Principles of Distributed Systems","author":"E.L. Wong","year":"2011","unstructured":"Wong, E.L., Levy, I., Alvisi, L., Clement, A., Dahlin, M.: Regret freedom isn\u2019t free. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 80\u201395. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:36:05Z","timestamp":1558103765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}