Modeling Tacit Collusion in Auctions
We study tacit collusion, which we interpret as collusion without communication about strategies, in repeated auctions in which bidders can only observe past winners and not their bids. Strategies cannot discriminate among initially nameless bidders until they have become named through winning an auction. We obtain two classes of results: (1) Completely refraining from using names rules out collusion altogether, and even if naming is permitted, as per our definition of tacit collusion, the lack of communication limits collusive strategies and payoffs among impatient bidders. (2) Sufficiently patient bidders can overcome the attainability constraints imposed by lack of communication and obtain approximately the same collusive gain as absent communication.
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.
Volume (Year): 164 (2008)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: https://www.mohr.de/jite|
|Order Information:|| Postal: Mohr Siebeck GmbH & Co. KG, P.O.Box 2040, 72010 Tübingen, Germany|
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.:
- Bhaskar, V., 2000. "Egalitarianism and Efficiency in Repeated Symmetric Games," Games and Economic Behavior, Elsevier, vol. 32(2), pages 247-262, August.
- Susan Athey & Kyle Bagwell, 1999.
"Optimal Collusion with Private Information,"
99-17, Massachusetts Institute of Technology (MIT), Department of Economics.
- Robert Aumann & Adam Brandenburger, 2014.
"Epistemic Conditions for Nash Equilibrium,"
World Scientific Book Chapters,
in: The Language of Game Theory Putting Epistemics into the Mathematics of Games, chapter 5, pages 113-136
World Scientific Publishing Co. Pte. Ltd..
- Blume, Andreas, 2000.
"Coordination and Learning with a Partial Language,"
Journal of Economic Theory,
Elsevier, vol. 95(1), pages 1-36, November.
- Blume, Andreas, 1998. "Coordination and Learning with a Partial Language," Working Papers 98-11, University of Iowa, Department of Economics.
- Andreas Blume, 1998. "Coordination and Learning with a Partial Language," CIG Working Papers FS IV 98-11, Wissenschaftszentrum Berlin (WZB), Research Unit: Competition and Innovation (CIG).
- Abreu, Dilip & Pearce, David & Stacchetti, Ennio, 1986. "Optimal cartel equilibria with imperfect monitoring," Journal of Economic Theory, Elsevier, vol. 39(1), pages 251-269, June.
When requesting a correction, please mention this item's handle: RePEc:mhr:jinste:urn:sici:0932-4569(200803)164:1_163:mtcia_2.0.tx_2-y. 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: (Thomas Wolpert)
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.