Advanced Search
MyIDEAS: Login to save this article or follow this journal

Optimality and Robustness of the English Auction

Contents:

Author Info

  • Lopomo, Giuseppe

Abstract

This paper attempts to reconcile the observed popularity of the English auction with the hypothesis that the trading mechanism is chosen with the objective of maximizing the seller's expected revenue. Under the assumptions of Milgrom and Weber's [20] 'general symmetric model,' I show the following three results. First, the 'augumented' English auction, in which the auctioneer sets the reserve price after all but one bidder have dropped out, generates at least as much seller's expected revenue as any ex post incentive-compatible (EPIC) and individually rational (EPIR) direct mechanisms. EPIC and EPIR direct mechanisms correspond to "belief-free" selling procedures. Thus this restriction of the set of feasible selling mechanisms aims at capturing a notion of robustness with respect to pertubations of the buyers' beliefs about their opponents' private information. Second, in the larger set of mechanisms, characterized by the property that 'losers do not pay,' ther! e exist auctions that generate a higher seller's expected revenue than the (augmented) English auction. Third, with two buyers, for a large class of signals' distributions, the augmented English auction maximizes the seller's expected revenue among all selling procedures where the loser does not pay and each buyer's payment is nondecreaseing in his own signal. With private values, these two conditions are satisfied by many equilibria in a class of bidding mechanisms, which includes approximations of both the Dutch auction and the English auction with discrete price increments. With more than two buyers, the English auction is optmal among all ex post efficient mechanisms where the losers do not pay and each buyer's payment is monotone in his signal.

(This abstract was borrowed from another version of this item.)

Download Info

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: http://www.sciencedirect.com/science/article/B6WFW-458NM4S-10/2/4be8cdbe6354e7c45a11a1d6db706186
Download Restriction: Full text for ScienceDirect subscribers only

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.

Bibliographic Info

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 36 (2001)
Issue (Month): 2 (August)
Pages: 219-240

as in new window
Handle: RePEc:eee:gamebe:v:36:y:2001:i:2:p:219-240

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

References

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. McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
  2. Krishna, Vijay & Morgan, John, 1997. "An Analysis of the War of Attrition and the All-Pay Auction," Journal of Economic Theory, Elsevier, vol. 72(2), pages 343-362, February.
  3. Steven A. Matthews, 1981. "Selling to Risk Averse Buyers with Unobservable Tastes," Discussion Papers 480S, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  4. Riley, John G, 1988. "Ex Post Information in Auctions," Review of Economic Studies, Wiley Blackwell, vol. 55(3), pages 409-29, July.
  5. J. Riley & E. Maskin, 1981. "Optimal Auctions with Risk Averse Buyers," Working papers 311, Massachusetts Institute of Technology (MIT), Department of Economics.
  6. Paul Milgrom & Robert J. Weber, 1981. "A Theory of Auctions and Competitive Bidding," Discussion Papers 447R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  7. Riley, John G & Samuelson, William F, 1981. "Optimal Auctions," American Economic Review, American Economic Association, vol. 71(3), pages 381-92, June.
  8. Bikhchandani, Sushil & Riley, John G., 1991. "Equilibria in open common value auctions," Journal of Economic Theory, Elsevier, vol. 53(1), pages 101-130, February.
  9. Roger B. Myerson, 1978. "Optimal Auction Design," Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  10. Paul R. Milgrom, 1985. "Auction Theory," Cowles Foundation Discussion Papers 779, Cowles Foundation for Research in Economics, Yale University.
  11. Giuseppe Lopomo, 2004. "The English Auction Is Optimal Among Simple Sequential Auctions," Levine's Bibliography 122247000000000369, UCLA Department of Economics.
  12. McAfee, R Preston & Reny, Philip J, 1992. "Correlated Information and Mechanism Design," Econometrica, Econometric Society, vol. 60(2), pages 395-421, March.
  13. Green, Jerry R & Laffont, Jean-Jacques, 1987. "Posterior Implementability in a Two-Person Decision Problem," Econometrica, Econometric Society, vol. 55(1), pages 69-94, January.
  14. Cremer, Jacques & McLean, Richard P, 1988. "Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions," Econometrica, Econometric Society, vol. 56(6), pages 1247-57, November.
  15. Bulow, Jeremy & Roberts, John, 1989. "The Simple Economics of Optimal Auctions," Journal of Political Economy, University of Chicago Press, vol. 97(5), pages 1060-90, October.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Bulow, Jeremy I & Klemperer, Paul, 2007. "When are Auctions Best?," CEPR Discussion Papers 6393, C.E.P.R. Discussion Papers.
  2. Ruqu Wang & Jun Zhang, 2010. "Common Value Auctions with Return Policies," Working Papers 1235, Queen's University, Department of Economics.
  3. Hannu Vartiainen, 2003. "Auction Design without Commitment," Working Papers 2003.24, Fondazione Eni Enrico Mattei.
  4. Bulow, Jeremy I. & Klemperer, Paul, 2009. "Why Do Sellers (Usually) Prefer Auctions?," CEPR Discussion Papers 7411, C.E.P.R. Discussion Papers.
  5. Lamy, Laurent, 2009. "The Shill Bidding Effect versus the Linkage Principle," Journal of Economic Theory, Elsevier, vol. 144(1), pages 390-413, January.
  6. Laurent Lamy, 2010. ""Upping the ante": How to design efficient auctions with entry?," PSE Working Papers halshs-00564888, HAL.
  7. repec:hal:wpaper:halshs-00564888 is not listed on IDEAS

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:36:y:2001:i:2:p:219-240. 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: (Zhang, Lei).

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.