IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v85y2014icp19-31.html
   My bibliography  Save this article

On the communication complexity of approximate Nash equilibria

Author

Listed:
  • Goldberg, Paul W.
  • Pastink, Arnoud

Abstract

We study the problem of computing approximate Nash equilibria of bimatrix games, in a setting where players initially know their own payoffs but not the other player's. In order to find a solution of reasonable quality, some amount of communication is required. We study algorithms where the communication is substantially less than the size of the game. When the communication is polylogarithmic in the number of strategies, we show how to obtain ϵ-approximate Nash equilibrium for ϵ≈0.438, and for well-supported approximate equilibria we obtain ϵ≈0.732. For one-way communication we show that ϵ=12 is the best approximation quality achievable, while for well-supported equilibria, no value of ϵ<1 is achievable. When the players do not communicate at all, ϵ-Nash equilibria can be obtained for ϵ=34; we also provide a corresponding lower bound of slightly more than 12 on the smallest constant ϵ achievable.

Suggested Citation

  • Goldberg, Paul W. & Pastink, Arnoud, 2014. "On the communication complexity of approximate Nash equilibria," Games and Economic Behavior, Elsevier, vol. 85(C), pages 19-31.
    • Handle: RePEc:eee:gamebe:v:85:y:2014:i:c:p:19-31
    DOI: 10.1016/j.geb.2014.01.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825614000128
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2014.01.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Foster, Dean P. & Vohra, Rakesh V., 1997. "Calibrated Learning and Correlated Equilibrium," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 40-55, October.
    2. Paul Goldberg & Rahul Savani & Troels Sørensen & Carmine Ventre, 2013. "On the approximation performance of fictitious play in finite games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1059-1083, November.
    3. Sergiu Hart & Andreu Mas-Colell, 2013. "Stochastic Uncoupled Dynamics And Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 8, pages 165-189, World Scientific Publishing Co. Pte. Ltd..
    4. Sergiu Hart & Andreu Mas-Colell, 2013. "A Simple Adaptive Procedure Leading To Correlated Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 2, pages 17-46, World Scientific Publishing Co. Pte. Ltd..
    5. Sergiu Hart & Yishay Mansour, 2013. "How Long To Equilibrium? The Communication Complexity Of Uncoupled Equilibrium Procedures," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 10, pages 215-249, World Scientific Publishing Co. Pte. Ltd..
    6. Sergiu Hart & Andreu Mas-Colell, 2013. "Uncoupled Dynamics Do Not Lead To Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 7, pages 153-163, World Scientific Publishing Co. Pte. Ltd..
    7. , P. & , Peyton, 2006. "Regret testing: learning to play Nash equilibrium without knowing you have an opponent," Theoretical Economics, Econometric Society, vol. 1(3), pages 341-367, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Babichenko, Yakov & Rubinstein, Aviad, 2022. "Communication complexity of approximate Nash equilibria," Games and Economic Behavior, Elsevier, vol. 134(C), pages 376-398.
    2. J. E. Abdou & E. Safatly & B. Nakhle & A. El Khoury, 2017. "High-Dimensional Nash Equilibria Problems and Tensors Applications," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 19(03), pages 1-25, September.
    3. Cole, Richard & Tao, Yixin, 2021. "On the existence of Pareto Efficient and envy-free allocations," Journal of Economic Theory, Elsevier, vol. 193(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tom Johnston & Michael Savery & Alex Scott & Bassel Tarbush, 2023. "Game Connectivity and Adaptive Dynamics," Papers 2309.10609, arXiv.org, revised Nov 2023.
    2. Burkhard C. Schipper, 2022. "Strategic Teaching and Learning in Games," American Economic Journal: Microeconomics, American Economic Association, vol. 14(3), pages 321-352, August.
    3. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    4. Sergiu Hart & Yishay Mansour, 2013. "How Long To Equilibrium? The Communication Complexity Of Uncoupled Equilibrium Procedures," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 10, pages 215-249, World Scientific Publishing Co. Pte. Ltd..
    5. Babichenko, Yakov, 2012. "Completely uncoupled dynamics and Nash equilibria," Games and Economic Behavior, Elsevier, vol. 76(1), pages 1-14.
    6. Foster, Dean P. & Hart, Sergiu, 2018. "Smooth calibration, leaky forecasts, finite recall, and Nash dynamics," Games and Economic Behavior, Elsevier, vol. 109(C), pages 271-293.
    7. Germano, Fabrizio & Lugosi, Gabor, 2007. "Global Nash convergence of Foster and Young's regret testing," Games and Economic Behavior, Elsevier, vol. 60(1), pages 135-154, July.
    8. Hart, Sergiu & Nisan, Noam, 2018. "The query complexity of correlated equilibria," Games and Economic Behavior, Elsevier, vol. 108(C), pages 401-410.
    9. Burkhard Schipper, 2015. "Strategic teaching and learning in games," Working Papers 151, University of California, Davis, Department of Economics.
    10. Marden, Jason R., 2017. "Selecting efficient correlated equilibria through distributed learning," Games and Economic Behavior, Elsevier, vol. 106(C), pages 114-133.
    11. Young, H. Peyton, 2009. "Learning by trial and error," Games and Economic Behavior, Elsevier, vol. 65(2), pages 626-643, March.
    12. Vivaldo M. Mendes & Diana A. Mendes & Orlando Gomes, 2008. "Learning to Play Nash in Deterministic Uncoupled Dynamics," Working Papers Series 1 ercwp1808, ISCTE-IUL, Business Research Unit (BRU-IUL).
    13. Babichenko, Yakov & Rubinstein, Aviad, 2022. "Communication complexity of approximate Nash equilibria," Games and Economic Behavior, Elsevier, vol. 134(C), pages 376-398.
    14. Pradelski, Bary S.R. & Young, H. Peyton, 2012. "Learning efficient Nash equilibria in distributed systems," Games and Economic Behavior, Elsevier, vol. 75(2), pages 882-897.
    15. Yakov Babichenko, 2012. "Best-Reply Dynamics in Large Anonymous Games," Discussion Paper Series dp600, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    16. Itai Arieli & H Peyton Young, 2011. "Stochastic Learning Dynamics and Speed of Convergence in Population Games," Economics Series Working Papers 570, University of Oxford, Department of Economics.
    17. Holly P. Borowski & Jason R. Marden & Jeff S. Shamma, 2019. "Learning to Play Efficient Coarse Correlated Equilibria," Dynamic Games and Applications, Springer, vol. 9(1), pages 24-46, March.
    18. H. Peyton Young, 2007. "The Possible and the Impossible in Multi-Agent Learning," Economics Series Working Papers 304, University of Oxford, Department of Economics.
    19. Sergiu Hart & Andreu Mas-Colell, 2013. "Stochastic Uncoupled Dynamics And Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 8, pages 165-189, World Scientific Publishing Co. Pte. Ltd..
    20. Karl Schlag & Andriy Zapechelnyuk, 2009. "Decision Making in Uncertain and Changing Environments," Discussion Papers 19, Kyiv School of Economics.

    More about this item

    Keywords

    Two player; Mixed strategy; Approximate equilibria; Efficient algorithms;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:85:y:2014:i:c:p:19-31. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.