IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this article

Dominance-solvable common-value large auctions

Listed author(s):
  • Azrieli, Yaron
  • Levin, Dan

We consider second-price common-value auctions with an increasing number of bidders. We define a strategy of bidder i to be (ex-post, weakly) asymptotically dominated if there is another strategy for i that does, in the limit, as well against any sequence of strategies of iʼs opponents, and with positive probability does strictly better against at least one sequence. Our main result provides a sufficient condition on the information structure for the process of iteratively deleting asymptotically dominated strategies to terminate after just two iterations, with only one strategy left for each player. This strategy is fully characterized. We also show that, under standard assumptions, a similar condition to that of Wilson (1977) implies our sufficient condition and therefore implies asymptotic dominance solvability.

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.sciencedirect.com/science/article/pii/S0899825611000480
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 73 (2011)
Issue (Month): 2 ()
Pages: 301-309

as
in new window

Handle: RePEc:eee:gamebe:v:73:y:2011:i:2:p:301-309
DOI: 10.1016/j.geb.2011.02.008
Contact details of provider: Web page: http://www.elsevier.com/locate/inca/622836

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. Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-1151, November.
  2. Wolfgang Pesendorfer & Jeroen M. Swinkels, 1997. "The Loser's Curse and Information Aggregation in Common Value Auctions," Econometrica, Econometric Society, vol. 65(6), pages 1247-1282, November.
  3. Einy, Ezra & Haimanko, Ori & Orzach, Ram & Sela, Aner, 2002. "Dominance solvability of second-price auctions with differential information," Journal of Mathematical Economics, Elsevier, vol. 37(3), pages 247-258, May.
  4. Dekel, Eddie & Fudenberg, Drew, 1990. "Rational behavior with payoff uncertainty," Journal of Economic Theory, Elsevier, vol. 52(2), pages 243-267, December.
  5. Battigalli Pierpaolo & Siniscalchi Marciano, 2003. "Rationalization and Incomplete Information," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 3(1), pages 1-46, June.
  6. Levin, Dan, 1986. "On dominance solvable auctions in the general symmetric model," Economics Letters, Elsevier, vol. 22(2-3), pages 165-167.
  7. Milgrom, Paul R, 1979. "A Convergence Theorem for Competitive Bidding with Differential Information," Econometrica, Econometric Society, vol. 47(3), pages 679-688, May.
  8. Battigalli, Pierpaolo, 2003. "Rationalizability in infinite, dynamic games with incomplete information," Research in Economics, Elsevier, vol. 57(1), pages 1-38, March.
  9. Dekel, Eddie & Wolinsky, Asher, 2003. "Rationalizable outcomes of large private-value first-price discrete auctions," Games and Economic Behavior, Elsevier, vol. 43(2), pages 175-188, May.
  10. Battigalli, Pierpaolo & Siniscalchi, Marciano, 2003. "Rationalizable bidding in first-price auctions," Games and Economic Behavior, Elsevier, vol. 45(1), pages 38-72, October.
  11. Adam Brandenburger & Amanda Friedenberg & H. Jerome Keisler, 2014. "Admissibility in Games," World Scientific Book Chapters,in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 7, pages 161-212 World Scientific Publishing Co. Pte. Ltd..
  12. In-Koo Cho, 2005. "Monotonicity and Rationalizability in a Large First Price Auction," Review of Economic Studies, Oxford University Press, vol. 72(4), pages 1031-1055.
  13. Ronald M. Harstad & Dan Levin, 1985. "A Class of Dominance Solvable Common-Value Auctions," Review of Economic Studies, Oxford University Press, vol. 52(3), pages 525-528.
  14. Ilan Kremer, 2002. "Information Aggregation in Common Value Auctions," Econometrica, Econometric Society, vol. 70(4), pages 1675-1682, July.
  15. Robert Wilson, 1977. "A Bidding Model of Perfect Competition," Review of Economic Studies, Oxford University Press, vol. 44(3), pages 511-518.
Full references (including those not matched with items on IDEAS)

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

When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:73:y:2011:i:2:p:301-309. 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: (Dana Niculescu)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.