Shlomit Hon-Snir (The Technion) Dov Monderer (The Technion) Aner Sela (Bonn University)
Abstract
We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large time, the players' bids are in equilibrium in the one-shot auction in which the types are commonly known.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
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.:
Fudenberg, D. & Levine, D.K., 1991.
"Self-Confirming Equilibrium ,"
Working papers
581, Massachusetts Institute of Technology (MIT), Department of Economics.
Other versions: