Advanced Search
MyIDEAS: Login to save this article or follow this journal

Dominance-solvable common-value large auctions


Author Info

  • 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.

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:
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.

Bibliographic Info

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

Contact details of provider:
Web page:

Related research

Keywords: Large auctions; Common value; Dominance solvability; Rationalizability;

Find related papers by JEL classification:


No references listed on IDEAS
You can help add them by filling out this form.



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


Access and download statistics


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: (Zhang, Lei).

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.