Advanced Search
MyIDEAS: Login to save this paper or follow this series

Stochastic Uncoupled Dynamics and Nash Equilibrium

Contents:

Author Info

  • Sergiu Hart

    ()

  • Andreu Mas-Colell

    ()

Abstract

In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence to Nash equilibria, and present a number of possibility and impossibility results. Basically, we show that if in addition to random moves some recall is introduced, then successful search procedures that are uncoupled can be devised. In particular, to get almost sure convergence to pure Nash equilibria when these exist, it suffices to recall the last two periods of play.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://www.ma.huji.ac.il/~hart/abs/uncoupl-st.html
Download Restriction: no

Bibliographic Info

Paper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp371.

as in new window
Length: 24 pages
Date of creation: Oct 2004
Date of revision:
Handle: RePEc:huj:dispap:dp371

Contact details of provider:
Postal: Feldman Building - Givat Ram - 91904 Jerusalem
Phone: +972-2-6584135
Fax: +972-2-6513681
Email:
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Fabrizio Germano & Gábor Lugosi, 2004. "Global Nash convergence of Foster and Young's regret testing," Economics Working Papers 788, Department of Economics and Business, Universitat Pompeu Fabra.
  2. Sergiu Hart & Andreu Mas-Colell, 1997. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Game Theory and Information 9703006, EconWPA, revised 24 Mar 1997.
  3. Sergiu Hart, 2005. "Adaptive Heuristics," Econometrica, Econometric Society, vol. 73(5), pages 1401-1430, 09.
  4. Hart, Sergiu & Mas-Colell, Andreu, 2003. "Regret-based continuous-time dynamics," Games and Economic Behavior, Elsevier, vol. 45(2), pages 375-394, November.
  5. Jordan J. S., 1993. "Three Problems in Learning Mixed-Strategy Nash Equilibria," Games and Economic Behavior, Elsevier, vol. 5(3), pages 368-386, July.
  6. 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.
  7. Young, H. Peyton, 2004. "Strategic Learning and its Limits," OUP Catalogue, Oxford University Press, number 9780199269181, September.
  8. Peyton Young, 2002. "Learning Hypothesis Testing and Nash Equilibrium," Economics Working Paper Archive 474, The Johns Hopkins University,Department of Economics.
  9. Sergiu Hart & Andreu Mas-Colell, 2003. "Uncoupled Dynamics Do Not Lead to Nash Equilibrium," American Economic Review, American Economic Association, vol. 93(5), pages 1830-1836, December.
  10. Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
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 in new window

Cited by:
  1. repec:hal:wpaper:hal-00817201 is not listed on IDEAS
  2. George Mailath & Wojciech Olszewski, 2008. "Folk theorems with Bounded Recall under(Almost) Perfect Monitoring," Discussion Papers 1462, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  3. Arieli, Itai & Babichenko, Yakov, 2012. "Average testing and Pareto efficiency," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2376-2398.
  4. Heinrich H. Nax & Maxwell N. Burton-Chellew & Stuart A. West & H. Peyton Young, 2013. "Learning in a Black Box," PSE Working Papers hal-00817201, HAL.
  5. H Peyton Young & H.H. Nax & M.N. Burton-Chellew & S.A. West, 2013. "Learning in a Black Box," Economics Series Working Papers 653, University of Oxford, Department of Economics.
  6. Hart, Sergiu & Mansour, Yishay, 2010. "How long to equilibrium? The communication complexity of uncoupled equilibrium procedures," Games and Economic Behavior, Elsevier, vol. 69(1), pages 107-126, May.
  7. 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, vol. 42(4), pages 1059-1083, November.
  8. Fabrizio Germano & Gábor Lugosi, 2004. "Global Nash convergence of Foster and Young's regret testing," Economics Working Papers 788, Department of Economics and Business, Universitat Pompeu Fabra.
  9. Babichenko, Yakov, 2012. "Completely uncoupled dynamics and Nash equilibria," Games and Economic Behavior, Elsevier, vol. 76(1), pages 1-14.
  10. Yakov Babichenko, 2007. "Uncoupled Automata and Pure Nash Equilibria," Discussion Paper Series dp459, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  11. 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.
  12. Yakov Babichenko, 2007. "Uncoupled Automata and Pure Nash Equilibria," Levine's Bibliography 843644000000000369, UCLA Department of Economics.
  13. Yakov Babichenko, 2010. "Completely Uncoupled Dynamics and Nash Equilibria," Discussion Paper Series dp529, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  14. H Peyton Young & Jason R. Marden and Lucy Y. Pao, 2011. "Achieving Pareto Optimality Through Distributed Learning," Economics Series Working Papers 557, University of Oxford, Department of Economics.
  15. Yakov Babichenko, 2014. "How long to Pareto efficiency?," International Journal of Game Theory, Springer, vol. 43(1), pages 13-24, February.
  16. Yakov Babichenko, 2012. "Best-Reply Dynamics in Large Anonymous Games," Discussion Paper Series dp600, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  17. George J. Mailath & : Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Second Version," PIER Working Paper Archive 08-027, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Jul 2008.
  18. Young, H. Peyton, 2009. "Learning by trial and error," Games and Economic Behavior, Elsevier, vol. 65(2), pages 626-643, March.
  19. Dean P Foster & Peyton Young, 2006. "Regret Testing Leads to Nash Equilibrium," Levine's Working Paper Archive 784828000000000676, David K. Levine.
  20. 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.
  21. H. Peyton Young, 2007. "The Possible and the Impossible in Multi-Agent Learning," Economics Series Working Papers 304, University of Oxford, Department of Economics.
  22. Vasin, A., 2010. "Evolutionary Game Theory and Economics. Part 2. Stability of Equilibria. Special Features of Human Behavior Evolution," Journal of the New Economic Association, New Economic Association, issue 5, pages 10-27.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp371. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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