[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/huj/dispap/dp419.html
   My bibliography  Save this paper

The Communication Complexity of Uncoupled Nash Equilibrium Procedures

Author

Listed:
  • Sergiu Hart
  • Yishay Mansour
Abstract
We study the question of how long it takes players to reach a Nash equilibrium in "uncoupled" setups, where each player initially knows only his own payoff function. We derive lower bounds on the number of bits that need to be transmitted in order to reach a Nash equilibrium, and thus also on the required number of steps. Specifically, we show lower bounds that are exponential in the number of players in each one of the following cases: (1) reaching a pure Nash equilibrium; (2) reaching a pure Nash equilibrium in a Bayesian setting; and (3) reaching a mixed Nash equilibrium. Finally, we show that some very simple and naive procedures lead to similar exponential upper bounds.

Suggested Citation

  • Sergiu Hart & Yishay Mansour, 2006. "The Communication Complexity of Uncoupled Nash Equilibrium Procedures," Discussion Paper Series dp419, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    • Handle: RePEc:huj:dispap:dp419
    as

    Download full text from publisher

    File URL: http://www.ma.huji.ac.il/hart/abs/aumann-n.html
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Fudenberg, Drew & Levine, David, 1998. "Learning in games," European Economic Review, Elsevier, vol. 42(3-5), pages 631-639, May.
    2. Sergiu Hart, 2013. "Adaptive Heuristics," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 11, pages 253-287, World Scientific Publishing Co. Pte. Ltd..
    3. Sergiu Hart & Andreu Mas-Colell, 2013. "A General Class Of Adaptive Strategies," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 3, pages 47-76, World Scientific Publishing Co. Pte. Ltd..
    4. Foster, Dean P. & Young, H. Peyton, 2003. "Learning, hypothesis testing, and Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 45(1), pages 73-96, October.
    5. Aumann, Robert J., 1974. "Subjectivity and correlation in randomized strategies," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 67-96, March.
    6. 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..
    7. Drew Fudenberg & David K. Levine, 1998. "The Theory of Learning in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061945, April.
    8. 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..
    9. Stoltz, Gilles & Lugosi, Gabor, 2007. "Learning correlated equilibria in games with compact sets of strategies," Games and Economic Behavior, Elsevier, vol. 59(1), pages 187-208, April.
    10. 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.
    11. 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.
    12. Amotz Cahn, 2004. "General procedures leading to correlated equilibria," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 21-40, January.
    13. Dean P Foster & Peyton Young, 2006. "Regret Testing Leads to Nash Equilibrium," Levine's Working Paper Archive 784828000000000676, David K. Levine.
    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. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
    2. Levin, Hagay & Schapira, Michael & Zohar, Aviv, 2008. "Interdomain routing and games," MPRA Paper 8476, University Library of Munich, Germany.
    3. J. Jordan, 2009. "Communication complexity and stability of equilibria in economies and games," Review of Economic Design, Springer;Society for Economic Design, vol. 13(1), pages 115-135, April.
    4. 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.

    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. 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..
    2. 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.
    3. Burkhard C. Schipper, 2022. "Strategic Teaching and Learning in Games," American Economic Journal: Microeconomics, American Economic Association, vol. 14(3), pages 321-352, August.
    4. Burkhard Schipper, 2015. "Strategic teaching and learning in games," Working Papers 151, University of California, Davis, Department of Economics.
    5. Dean P Foster & Peyton Young, 2006. "Regret Testing Leads to Nash Equilibrium," Levine's Working Paper Archive 784828000000000676, David K. Levine.
    6. 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).
    7. 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.
    8. 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..
    9. Michel Benaïm & Josef Hofbauer & Sylvain Sorin, 2006. "Stochastic Approximations and Differential Inclusions, Part II: Applications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 673-695, November.
    10. Ayan Bhattacharya, 2019. "On Adaptive Heuristics that Converge to Correlated Equilibrium," Games, MDPI, vol. 10(1), pages 1-11, January.
    11. Michael Foley & Rory Smead & Patrick Forber & Christoph Riedl, 2021. "Avoiding the bullies: The resilience of cooperation among unequals," PLOS Computational Biology, Public Library of Science, vol. 17(4), pages 1-18, April.
    12. Young, H. Peyton, 2009. "Learning by trial and error," Games and Economic Behavior, Elsevier, vol. 65(2), pages 626-643, March.
    13. Rene Saran & Roberto Serrano, 2012. "Regret Matching with Finite Memory," Dynamic Games and Applications, Springer, vol. 2(1), pages 160-175, March.
    14. Marden, Jason R. & Shamma, Jeff S., 2015. "Game Theory and Distributed Control****Supported AFOSR/MURI projects #FA9550-09-1-0538 and #FA9530-12-1-0359 and ONR projects #N00014-09-1-0751 and #N0014-12-1-0643," Handbook of Game Theory with Economic Applications,, Elsevier.
    15. Du, Ye & Lehrer, Ehud, 2020. "Constrained no-regret learning," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 16-24.
    16. Hart, Sergiu & Nisan, Noam, 2018. "The query complexity of correlated equilibria," Games and Economic Behavior, Elsevier, vol. 108(C), pages 401-410.
    17. Nicolò Cesa-Bianchi & Gábor Lugosi & Gilles Stoltz, 2006. "Regret Minimization Under Partial Monitoring," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 562-580, August.
    18. Stoltz, Gilles & Lugosi, Gabor, 2007. "Learning correlated equilibria in games with compact sets of strategies," Games and Economic Behavior, Elsevier, vol. 59(1), pages 187-208, April.
    19. Sergiu Hart & Andreu Mas-Colell, 2002. "Uncoupled dynamics cannot lead to Nash equilibrium," Discussion Paper Series dp299, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    20. H. Peyton Young, 2007. "The Possible and the Impossible in Multi-Agent Learning," Economics Series Working Papers 304, University of Oxford, Department of Economics.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:huj:dispap:dp419. 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: Michael Simkin (email available below). General contact details of provider: https://edirc.repec.org/data/crihuil.html .

    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.