First-best collusion without communication
I study a 2-bidder infinitely repeated IPV first-price auction without transfers, communication, or public randomization, where each bidderʼs valuation can assume, in each of the (statistically independent) stage games, one of three possible values. Under certain distributional assumptions, the following holds: for every ϵ>0 there is a nondegenerate interval Δ(ϵ)⊂(0,1), such that if the biddersʼ discount factor belongs to Δ(ϵ), then there exists a Perfect Public Equilibrium with payoffs ϵ-close to the first-best payoffs.
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.
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.
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.:
- First:Birgit Heydenreich & Rudolf Muller & Marc Uetz & Rakesh Vohra, 2007.
"Characterization of Revenue Equivalence,"
1448, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Heydenreich Birgit & Müller Rudolf & Uetz Marc & Vohra Rakesh, 2008. "Characterization of Revenue Equivalence," Research Memorandum 001, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Müller Rudolf & Uetz Marc & Vohra Rakesh & Heydenreich Birgit, 2007. "Characterization of Revenue Equivalence," Research Memorandum 017, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Mailath, George J. & Zemsky, Peter, 1991. "Collusion in second price auctions with heterogeneous bidders," Games and Economic Behavior, Elsevier, vol. 3(4), pages 467-486, November.
- Blume, Andreas & Heidhues, Paul, 2006.
"Private monitoring in auctions,"
Journal of Economic Theory,
Elsevier, vol. 131(1), pages 179-211, November.
- Susan Athey & Kyle Bagwell, 2004.
"Collusion with Persistent Cost Shocks,"
122247000000000334, UCLA Department of Economics.
- Rachmilevitch, Shiran, 2013. "Endogenous bid rotation in repeated auctions," Journal of Economic Theory, Elsevier, vol. 148(4), pages 1714-1725.
- McAfee, R. Preston & McMillan, John., 1990.
726, California Institute of Technology, Division of the Humanities and Social Sciences.
- Athey, Susan & Bagwell, Kyle, 2001.
"Optimal Collusion with Private Information,"
RAND Journal of Economics,
The RAND Corporation, vol. 32(3), pages 428-65, Autumn.
- Johannes Hörner & Julian Jamison, 2007. "Collusion with (almost) no information," RAND Journal of Economics, RAND Corporation, vol. 38(3), pages 804-822, 09.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:83:y:2014:i:c:p:224-230. 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: (Shamier, Wendy)
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.