This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Tacit Collusion in Repeated Auctions

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Andreas Blume
Paul Heidhues

Additional information is available for the following registered author(s):

Abstract

We study tacit collusion in repeated auctions in which bidders can only observe pastwinners and not their bids. We adopt a stringent interpretation of tacit collusion ascollusion without communication about strategies that we model as a symmetryrestriction on repeated game strategies: Strategies cannot discriminate among initiallynameless bidders until they have become named through winning an auction. We obtainthree classes of results: (1) Completely refraining from using names, i.e. strengtheningthe symmetry constraint, rules out collusion altogether, and even if naming is permitted,as per our definition of tacit collusion, the lack of communication limits collusivestrategies and payoffs among impatient bidders. (2) If communication is allowed, thereare sustained improvements over bid rotation and competitive bidding among patientbidders. (3) These gains extend to tacit collusion among patient bidders. However,whether tacit or not, collusion need not be efficient.

ZUSAMMENFASSUNG - (Stillschweigende Kollusion in wiederholten Auktionen)
Der Beitrag untersucht die Möglichkeiten von "tacit collusion" (stillschweigender Kollusion) in wiederholten Auktionsspielen in welchen nur die vergangenen Gewinner nicht aber deren Gebote bekannt sind. Dabei wird "tacit collusion" als kollusives Verhalten ohne Absprachen zwischen den Bietern interpretiert. In dem Artikel werden insbesondere auch vor dem Spiel getroffene Absprachen über Strategien ausgeschlossen. Das Fehlen solcher Absprachen wird durch Symmetrierestriktionen modelliert: Strategien können solange nicht zwischen anfangs "namenlosen" Bietern unterscheiden, bis diese sich durch das Gewinnen einer Auktion von den anderen Bietern differenzieren. Es werden drei Arten von Ergebnissen hergeleitet: (1) Stärkt man die Symmetrierestriktionen und verlangt symmetrisches Verhalten in jeder Periode, so kann keine Kollusion auftreten. Aber auch weniger starke Symmetrierestriktionen, die prinzipiell eine endogene Rollenverteilung ermöglichen, schränken die möglichen Kollusionsgewinne bei ungeduldigen Bietern ein. (2) Erlaubt man vor dem Spiel getroffene Absprachen über die Strategiewahl, so können hinreichend geduldige Bieter unbegrenzt höhere Gewinne erhalten als die Gewinne bei wiederholtem Konkurrenzverhalten oder bei einer einfachen Bieterrotation. (3) Dies gilt auch für Kollusion ohne Absprachen falls die Bieter hinreichend geduldig sind. Jedoch, ob mit oder ohne a-priori Absprachen, effiziente Kollusion kann selbst bei extrem geduldigen Bietern unmöglich sein.

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.

File URL: http://skylla.wz-berlin.de/pdf/2001/iv01-23.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Wissenschaftszentrum Berlin (WZB), Research Unit: Competition and Innovation (CIG) in its series CIG Working Papers with number FS IV 01-23.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 63 pages
Date of creation: Dec 2001
Date of revision:
Handle: RePEc:wzb:wzebiv:fsiv01-23

Contact details of provider:
Postal: Reichpietschufer 50, 10785 Berlin, Germany
Phone: (++49)(30) 25491-441
Fax: (++49)(30) 25491-442
Web page: http://www.wzb.eu/mp/wiw/default.en.htm
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Jennifer Rontganger).

Related research
Keywords: Tacit Collusion; Auctions; Supergames; Strategic Uncertainty; Language; Attainability;

Find related papers by JEL classification:
C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
D44 - Microeconomics - - Market Structure and Pricing - - - Auctions

Cited by:
(explanations, 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.)

  1. Atila Abdulkadiroglu & Kim-Sau Chung, 2002. "Mechanism design with tacit collusion," Discussion Papers 0102-68, Columbia University, Department of Economics. [Downloadable!]
  2. Leslie M. Marx & Robert C. Marshall, 2004. "Bidder Collusion," Econometric Society 2004 North American Winter Meetings 108, Econometric Society. [Downloadable!]
  3. Nicolas Gruyer, 2005. "Using lotteries in auctions when buyers collude," Economics Working Papers 02, LEEA (air transport economics laboratory), ENAC (french national civil aviation school). [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS was sponsored from 1997 to 2002 by the Université du Québec à Montréal.

This page was last updated on 2009-12-16.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.