research-article

Public Access

Dynamics at the Boundary of Game Theory and Distributed Computing

Authors:

Aaron D. Jaggard,

Michael Schapira,

Rebecca N. WrightAuthors Info & Claims

ACM Transactions on Economics and Computation (TEAC), Volume 5, Issue 3

Article No.: 15, Pages 1 - 20

https://doi.org/10.1145/3107182

Published: 09 August 2017 Publication History

Abstract

We use ideas from distributed computing and game theory to study dynamic and decentralized environments in which computational nodes, or decision makers, interact strategically and with limited information. In such environments, which arise in many real-world settings, the participants act as both economic and computational entities. We exhibit a general non-convergence result for a broad class of dynamics in asynchronous settings. We consider implications of our result across a wide variety of interesting and timely applications: game dynamics, circuit design, social networks, Internet routing, and congestion control. We also study the computational and communication complexity of testing the convergence of asynchronous dynamics. Our work opens a new avenue for research at the intersection of distributed computing and game theory.

References

[1]

Ittai Abraham, Danny Dolev, Rica Gonen, and Joe Halpern. 2006. 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 (PODC ’06). ACM, New York, NY, 53--62.

Digital Library

[2]

Maria-Florina Balcan, Florin Constantin, and Ruta Mehta. 2012. The weighted majority algorithm does not converge in nearly zero-sum games. In Proceedings of the ICML Workshop on Markets, Mechanisms and Multi-Agent Models.

[3]

Michael Ben-Or. 1986. Randomized agreement protocols. In Fault-Tolerant Distributed Computing, Barbara Simons and Alfred Spector (Eds.). Springer, New York, NY, 72--83.

[4]

Elizabeth Borowsky and Eli Gafni. 1993. Generalized FLP impossibility result for -resilient asynchronous computations. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC’93). ACM, New York, NY, 91--100.

Digital Library

[5]

James E. Burns. 1987. Self-stabilizing Rings Without Demons. Technical Report GIT-ICS-87/36. School of Information and Computer Science, Georgia Institute of Technology.

[6]

Constantinos Daskalakis, Rafael Frongillo, Christos H. Papadimitriou, George Pierrakos, and Gregory Valiant. 2010. On learning algorithms for Nash equilibria. In Proceedings of the Third International Symposium on Algorithmic Game Theory (SAGT’10), Spyros Kontogiannis, Elias Koutsoupias, and Paul G. Spirakis (Eds.). Springer, Berlin, 114--125.

[7]

Al Davis and Steven M. Nowick. 1997. An Introduction to Asynchronous Circuit Design. Technical Report. The Encyclopedia of Computer Science and Technology.

[8]

Edsger W. Dijkstra. 1974. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11 (1974), 643--644.

Digital Library

[9]

Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. 1987. On the minimal synchronism needed for distributed consensus. J. ACM 34, 1 (1987), 77--97.

Digital Library

[10]

Shlomi Dolev. 2000. Self-Stabilization. MIT Press, Cambridge, MA.

[11]

Roee Engelberg, Alex Fabrikant, Michael Schapira, and David Wajc. 2013. Best-response dynamics out of sync: Complexity and characterization. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC’13). ACM, New York, NY, 379--396.

Digital Library

[12]

A. A. Evdokimov. 1969. Maximal length of circuit in a unitary -dimensional cube. Math. Notes Acad. Sci. USSR 6, 3 (1969), 642--648.

[13]

Alex Fabrikant and Christos H. Papadimitriou. 2008. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08). SIAM, Philadelphia, PA, 844--853.

[14]

Faith Fich and Eric Ruppert. 2003. Hundreds of impossibility results for distributed computing. Distrib. Comput. 16, 2--3 (2003), 121--163.

Digital Library

[15]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (1985), 374--382.

Digital Library

[16]

P. Brighten Godfrey, Michael Schapira, Aviv Zohar, and Scott Shenker. 2010. Incentive compatibility and dynamics of congestion control. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS’10). ACM, New York, NY, 95--106.

Digital Library

[17]

Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong. 2002. The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10, 2 (2002), 232--243.

Digital Library

[18]

Joseph Y. Halpern. 2003. A computer scientist looks at game theory. Games Econ. Behav. 45, 1 (2003), 114--131.

[19]

Joseph Y. Halpern and Yoram Moses. 1990. Knowledge and common knowledge in a distributed environment. J. ACM 37, 3 (July1990), 549--587. 0004-5411DOI:https://dx.doi.org/10.1145/79147.79161

Digital Library

[20]

Sergiu Hart. 2005. Adaptive heuristics. Econometrica 73, 5 (2005), 1401--1430. https://www.jstor.org/stable/3598879

[21]

Sergiu Hart and Andreu Mas-Colell. 2003. Uncoupled dynamics do not lead to Nash equilibrium. Am. Econ. Rev. 93, 5 (2003), 1830--1836.

[22]

Sergiu Hart and Andreu Mas-Colell. 2006. Stochastic uncoupled dynamics and Nash equilibrium. Games Econ. Behav. 57, 2 (2006), 286--303.

[23]

Maurice Herlihy and Nir Shavit. 1999. The topological structure of asynchronous computability. J. ACM 46, 6 (1999), 858--923.

Digital Library

[24]

Nicole Immorlica, Jon Kleinberg, Mohammad Mahdian, and Tom Wexler. 2007. The role of compatibility in the diffusion of technologies through social networks. In Proceedings of the 8th ACM Conference on Electronic Commerce (EC’07). ACM, New York, NY, 75--83.

Digital Library

[25]

Aaron D. Jaggard, Michael Schapira, and Rebecca N. Wright. 2011. Distributed computing with adaptive heuristics. In Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS’11). Tsinghua University Press, Beijing, 417--443.

[26]

Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, and Éva Tardos. 2011. Beyond the Nash equilibrium barrier. In Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS’11). Tsinghua University Press, Beijing, 125--140.

[27]

Elias Koutsoupias and Christos Papadimitriou. 2009. Worst-case equilibria. Comput. Sci. Rev. 3, 2 (2009), 65--69.

Digital Library

[28]

Nate Kushman, Srikanth Kandula, Dina Katabi, and Bruce M. Maggs. 2007. R-BGP: Staying connected in a connected world. In Proceedings of the 4th USENIX Conference on Networked Systems Design & Implementation (NSDI’07). USENIX, Berkeley, CA.

[29]

Roger Lagunoff and Akihiko Matsui. 1997. Asynchronous choice in repeated coordination games. Econometrica 65, 6 (1997), 1467--1477. 00129682DOI:https://dx.doi.org/10.2307/2171745

[30]

Nancy Lynch. 1989. A hundred impossibility proofs for distributed computing. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC’89). ACM, New York, NY, 1--28.

Digital Library

[31]

Jason R. Marden and Jeff S. Shamma. 2012. Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation. Games Econ. Behav. 75, 2 (2012), 788--808.

[32]

Dov Monderer and Lloyd S. Shapley. 1996. Potential games. Games Econ. Behav. 14 (1996), 124--143.

[33]

Stephen Morris. 2000. Contagion. Rev. Econ. Stud. 67 (2000), 57--78.

[34]

Noam Nisan and Amir Ronen. 2001. Algorithmic mechanism design. Games Econ. Behav. 35, 1--2 (2001), 166--196.

[35]

Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani (Eds.). 2007. Algorithmic Game Theory. Cambridge University Press, New York, NY.

[36]

Christos H. Papadimitriou. 1994. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48, 3 (1994), 498--532.

Digital Library

[37]

Christos H. Papadimitriou and Georgios Piliouras. 2016. From Nash equilibria to chain recurrent sets: Solution concepts and topology. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ACM, New York, NY, 227--235.

[38]

Robert W. Rosenthal. 1973. A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2 (1973), 65--67. Issue 1.

Digital Library

[39]

Michael Saks and Fotios Zaharoglou. 2000. Wait-Free -Set Agreement is Impossible: The Topology of Public Knowledge. SIAM J. Comput. 29, 5 (2000), 1449--1483.

Digital Library

[40]

Rahul Sami, Michael Schapira, and Aviv Zohar. 2009. Searching for stability in interdomain routing. In Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM’09). IEEE Press, Piscataway, NJ, 549--557.

[41]

Yi Wang, Michael Schapira, and Jennifer Rexford. 2009. Neighbor-specific BGP: More flexible routing policies while improving global stability. In Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems (SIGMETRICS’09). ACM, New York, NY, 217--228.

Digital Library

[42]

Kiho Yoon. 2004. The effective minimax value of asynchronously repeated games. Int. J. Game Theory 32, 4 (2004), 431--442.

[43]

Andriy Zapechelnyuk. 2008. Better-reply dynamics with bounded recall. Math. Oper. Res. 33, 4 (2008), 869--879.

Cited By

Roig PAlcaraz SGilly KBernad CJuiz C(2023)Formal Algebraic Model of an Edge Data Center with a Redundant Ring TopologyNetwork10.3390/network30100073:1(142-157)Online publication date: 30-Jan-2023
https://doi.org/10.3390/network3010007
Leonardos SReijsbergen DPiliouras G(2020)PREStO: A Systematic Framework for Blockchain Consensus ProtocolsIEEE Transactions on Engineering Management10.1109/TEM.2020.298128667:4(1028-1044)Online publication date: Nov-2020
https://doi.org/10.1109/TEM.2020.2981286
Palaiopanos GPanageas IPiliouras G(2017)Multiplicative weights update with constant step-size in congestion gamesProceedings of the 31st International Conference on Neural Information Processing Systems10.5555/3295222.3295337(5874-5884)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.5555/3295222.3295337

Index Terms

Dynamics at the Boundary of Game Theory and Distributed Computing
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Distributed computing models
  2. Theory and algorithms for application domains
    1. Algorithmic game theory and mechanism design
      1. Convergence and learning in games

Recommendations

Distributed computing with rules of thumb
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

We present our recent work (ICS 2011) on dynamic environments in which computational nodes, or decision makers, follow simple and unsophisticated rules of behavior (e.g., repeatedly "best replying" to others' actions, and minimizing "regret") that have ...
Digital Game Dynamics Preferences and Player Types

In this study, we examine digital game preferences by identifying game dynamics, i.e. player-game interaction modes, of 700 contemporary digital games, and players' N = 1717 desire to play games with specific types of dynamics. Based on statistical ...
Automated Evaluation of Game Experience based on Game Dynamics and Motives for Play
CHI PLAY '22: Extended Abstracts of the 2022 Annual Symposium on Computer-Human Interaction in Play

This paper describes an automated evaluation of the overall game experience using a synthetic agent, that we contextualize for First-Person Shooter games. This evaluation method is based on the characterization of the game experience through dynamics ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Economics and Computation

ACM Transactions on Economics and Computation Volume 5, Issue 3

August 2017

107 pages

ISSN:2167-8375

EISSN:2167-8383

DOI:10.1145/3129279

Editors:
David Pennock
Microsoft
,
Ilya Segal
Stanford University

Issue’s Table of Contents

Copyright © 2017 ACM.

Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 August 2017

Accepted: 01 March 2017

Revised: 01 March 2017

Received: 01 July 2016

Published in TEAC Volume 5, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

National Science Foundation
Israel Science Foundation
Israeli Center for Research Excellence in Algorithms
Office of Naval Research

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
390
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)13

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Roig PAlcaraz SGilly KBernad CJuiz C(2023)Formal Algebraic Model of an Edge Data Center with a Redundant Ring TopologyNetwork10.3390/network30100073:1(142-157)Online publication date: 30-Jan-2023
https://doi.org/10.3390/network3010007
Leonardos SReijsbergen DPiliouras G(2020)PREStO: A Systematic Framework for Blockchain Consensus ProtocolsIEEE Transactions on Engineering Management10.1109/TEM.2020.298128667:4(1028-1044)Online publication date: Nov-2020
https://doi.org/10.1109/TEM.2020.2981286
Palaiopanos GPanageas IPiliouras G(2017)Multiplicative weights update with constant step-size in congestion gamesProceedings of the 31st International Conference on Neural Information Processing Systems10.5555/3295222.3295337(5874-5884)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.5555/3295222.3295337

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents