This paper considers the question of tacit collusion in repeated auctions with independent private values and with limited public monitoring. McAfee and McMillan show that the extent of collusion is tied to availability of transfers. Monetary transfers allow cartels to extract full surplus. A folk theorem proved by Fudenberg at al. shows that transfers of future payoffs are almost as good if players are patient and communicate before auctions. We ask how the scope of collusion is affected if players dispense with explicit communication. Collusion better than bid rotation is still feasible, but full surplus cannot be extracted. This constraint becomes less severe with more players and large cartels can become asymptotically efficient even with very limited monitoring. (This paper is a revised version of our paper "Bidding Rings in Repeated Auctions", Rochester Center for Economic Research Working Paper No. 463 (1999).)
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.
Publisher Info
Paper provided by Stanford University, Graduate School of Business in its series Research Papers with number
1698r2.
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.:
McAfee, R Preston & McMillan, John, 1992.
"Bidding Rings,"
American Economic Review,
American Economic Association, vol. 82(3), pages 579-99, June.
[Downloadable!] (restricted)
Other versions:
McAfee, R. Preston & McMillan, John., 1990.
"Bidding Rings,"
Working Papers
726, California Institute of Technology, Division of the Humanities and Social Sciences.
[Downloadable!]
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.) This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.