IDEAS home Printed from
MyIDEAS: Login to save this paper or follow this series

Optimal Repeated Auction with Tacit Collusion (joint with Atila Abdulkadiroglu)

  • Kim-Sau Chung

No abstract is available for this item.

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

Paper provided by UCLA Department of Economics in its series Theory workshop papers with number 357966000000000093.

in new window

Date of creation: 16 May 2002
Date of revision:
Handle: RePEc:cla:uclatw:357966000000000093
Contact details of provider: Web page:

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

as in new window
  1. Susan Athey & Kyle Bagwell & Chris Sanchirico, 2004. "Collusion and Price Rigidity," Review of Economic Studies, Wiley Blackwell, vol. 71(2), pages 317-349, 04.
  2. Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
  3. Jeffrey C. Ely & Juuso Valimaki, 1999. "A Robust Folk Theorem for the Prisoner's Dilemma," Discussion Papers 1264, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  4. McAfee, R. Preston & McMillan, John., 1990. "Bidding Rings," Working Papers 726, California Institute of Technology, Division of the Humanities and Social Sciences.
  5. Athey, Susan & Bagwell, Kyle, 2001. "Optimal Collusion with Private Information," RAND Journal of Economics, The RAND Corporation, vol. 32(3), pages 428-65, Autumn.
  6. Yeon-Koo Che & Seung-Weon Yoo, 2001. "Optimal Incentives for Teams," American Economic Review, American Economic Association, vol. 91(3), pages 525-541, June.
  7. Hopenhayn, Hugo A. & Skrzypacz, Andrzej, 2001. "Tacit Collusion in Repeated Auctions," Research Papers 1698r2, Stanford University, Graduate School of Business.
  8. Graham, Daniel A & Marshall, Robert C, 1987. "Collusive Bidder Behavior at Single-Object Second-Price and English Auctions," Journal of Political Economy, University of Chicago Press, vol. 95(6), pages 1217-39, December.
  9. Aoyagi, Masaki, 2003. "Bid rotation and collusion in repeated auctions," Journal of Economic Theory, Elsevier, vol. 112(1), pages 79-105, September.
  10. Roger B. Myerson, 1978. "Optimal Auction Design," Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
Full references (including those not matched with items on IDEAS)

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

When requesting a correction, please mention this item's handle: RePEc:cla:uclatw:357966000000000093. 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: (David K. Levine)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.