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

Ex-Post Regret Learning in Games with Fixed and Random Matching: The Case of Private Values

Contents:

Author Info

  • Rene Saran
  • Roberto Serrano

Abstract

In contexts in which players have no priors, we analyze a learning pro- cess based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are ran- domly matched to play the game (random matching). The relevant long run predictions are minimal sets that are closed under “the same or better reply” operations. Under additional assumptions in each case, the prediction boils down to pure Nash equilibria, pure ex-post equilibria or pure minimax regret equilibria. These three paradigms exhibit nice robustness properties in the sense that they are independent of beliefs about the exogenous uncertainty of type spaces. The results are illustrated in second-price auctions, first-price auctions and Bertrand duopolies.

(This abstract was borrowed from another version of this item.)

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.dklevine.com/archive/refs4661465000000000083.pdf
Download Restriction: no

Bibliographic Info

Paper provided by David K. Levine in its series Levine's Working Paper Archive with number 661465000000000083.

as in new window
Length:
Date of creation: 08 Jun 2010
Date of revision:
Handle: RePEc:cla:levarc:661465000000000083

Contact details of provider:
Web page: http://www.dklevine.com/

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. Eddie Dekel & Drew Fudenberg & David K. Levine, 2001. "Learning to Play Bayesian Games," Harvard Institute of Economic Research Working Papers 1926, Harvard - Institute of Economic Research.
  2. Hon-Snir, Shlomit & Monderer, Dov & Sela, Aner, 1998. "A Learning Approach to Auctions," Journal of Economic Theory, Elsevier, vol. 82(1), pages 65-88, September.
  3. Roberto Serrano & Rene Saran, 2007. "The Evolution Of Bidding Behavior In Private-Values Auctions And Double Auctions," Working Papers wp2007_0712, CEMFI.
  4. Sergiu Hart, 2005. "Adaptive Heuristics," Econometrica, Econometric Society, vol. 73(5), pages 1401-1430, 09.
  5. Spulber, Daniel F, 1995. "Bertrand Competition When Rivals' Costs Are Unknown," Journal of Industrial Economics, Wiley Blackwell, vol. 43(1), pages 1-11, March.
  6. Linhart, P. B. & Radner, R., 1989. "Minimax-regret strategies for bargaining over several variables," Journal of Economic Theory, Elsevier, vol. 48(1), pages 152-178, June.
  7. Ritzberger, Klaus & Weibull, Jörgen W., 1993. "Evolutionary Selection in Normal Form Games," Working Paper Series 383, Research Institute of Industrial Economics.
  8. Hans Jorgen Jacobsen & Mogens Jensen & Birgitte Sloth, 2000. "The Evolution of Conventions under Incomplete Information," Econometric Society World Congress 2000 Contributed Papers 1340, Econometric Society.
  9. Rene Saran & Roberto Serrano, 2010. "Regret Matching with Finite Memory," Working Papers 2010-10, Brown University, Department of Economics.
  10. Saran Rene & Serrano Roberto, 2010. "Regret Matching with Finite Memory," Research Memorandum 033, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  11. Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
  12. 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.
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. Rene Saran & Roberto Serrano, 2010. "Regret matching with finite memory," Working Papers 2010-10, Instituto Madrileño de Estudios Avanzados (IMDEA) Ciencias Sociales.
  2. Saran Rene & Serrano Roberto, 2010. "Regret Matching with Finite Memory," Research Memorandum 033, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

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:cla:levarc:661465000000000083. 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: (David K. Levine).

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.