Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4452))

Abstract

Sequential and simultaneous auctions are two important mechanisms for buying/selling multiple objects. These two mechanisms yield different outcomes (i.e., different revenues and also different profits to the winning bidders). Hence, both the auctioneer and the bidding agents want to know which mechanism is better for them. Given this, we compare the outcomes for these mechanisms for the following scenario. There are multiple similar objects for sale, each object is sold in a separate auction, and each bidder needs only one object. We use English auction rules and first determine equilibrium bidding strategies for each individual auction for the simultaneous and sequential cases. We do this for both common and private value objects by treating a bidder’s information about these values as uncertain. We then consider the case where the private and common values have a uniform distribution and compare the two mechanisms in terms of three key properties: a bidder’s ex-ante expected profit, the auctioneer’s expected cumulative revenue, and the total expected surplus. For both common and private value objects, our study shows the following result. The expected cumulative revenue and the expected total surplus is higher for the sequential mechanism. However, a bidder’s exante expected profit depends on the number of objects being auctioned and the number of participating bidders, and it is sometimes higher for the sequential mechanism and sometimes for the simultaneous one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernhardt, D., Scoones, D.: A note on sequential auctions. American Economic Review 84(3), 653–657 (1994)

    Google Scholar 

  2. Cliff, D.: Evolution of market mechanisms through a continuous space of auction types. Technical Report HPL-2001-326, HP Laboratories, Bristol (2001)

    Google Scholar 

  3. Cramton, P.: Simultaneous ascending auctions (2004), http://www.cramton.umd.edu/papers2000–2004

  4. David, H.: Order Statistics. Wiley, New York (1969)

    Google Scholar 

  5. Fatima, S.S.: A comparative study of sequential and simultaneous auctions. In Submission (2006)

    Google Scholar 

  6. Fatima, S.S., Wooldridge, M., Jennings, N.R.: Sequential auctions for objects with common and private values. In: Fourth International Conference on Autonomous Agents and Multi-Agent Systems, Utrecht, Netherlands, pp. 635–642 (2005)

    Google Scholar 

  7. Goeree, J.K., Offerman, T.: Competitive bidding in auctions with private and common values. The Economic Journal 113(489), 598–613 (2003)

    Article  Google Scholar 

  8. Greenwald, A., Boyan, J.: Bidding under uncertainty. In: Twentieth Conferene on Uncertainty in Artificial Intelligence, pp. 209–216 (2004)

    Google Scholar 

  9. Hausch, D.B.: Multi-object auctions: sequential vs. simultaneous sales. Management Science 32(12), 1599–1610 (1986)

    MATH  MathSciNet  Google Scholar 

  10. Jehiel, P., Moldovanu, B.: Efficient design with interdependent valuations. Econometrica 69, 1237–1259 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Krishna, V.: Auction Theory. Academic Press, London (2002)

    Google Scholar 

  12. McAfee, R.P., Vincent, D.: The declining price anomaly. Journal of Economic Theory 60, 191–212 (1993)

    Article  MATH  Google Scholar 

  13. Milgrom, P., Weber, R.J.: A theory of auctions and competitive bidding II. In: The Economic Theory of Auctions, Edward Elgar, Cheltenham (2000)

    Google Scholar 

  14. Ortega-Reichert, A.: Models of competitive bidding under uncertainty. Technical Report 8, Stanford University (1968)

    Google Scholar 

  15. Palfrey, T.: Bundling decisions by a multiproduct monopolist with incomplete information. Econometrica 51, 463–484 (1983)

    Article  MATH  Google Scholar 

  16. Pardoe, D., Stone, P.: Developing adaptive auction mechanisms. SIGecom Exchanges 5(3), 1–10 (2005)

    Article  Google Scholar 

  17. Engelbrecht-Wiggans, R., Weber, R.J.: An example of a multi-object auction game. Management Science 25(12), 1272–1277 (1979)

    Article  Google Scholar 

  18. Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance 16, 8–37 (1961)

    Article  Google Scholar 

  19. Weber, R.J.: Multiple-object auctions. In: Engelbrecht-Wiggans, R., Shibik, M., Stark, R.M. (eds.) Auctions, bidding, and contracting: Uses and theory, pp. 165–191. New York University Press, New York (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Maria Fasli Onn Shehory

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Fatima, S.S. (2007). A Comparison of Sequential and Simultaneous Auctions. In: Fasli, M., Shehory, O. (eds) Agent-Mediated Electronic Commerce. Automated Negotiation and Strategy Design for Electronic Markets. TADA AMEC 2006 2006. Lecture Notes in Computer Science(), vol 4452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72502-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72502-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72501-5

  • Online ISBN: 978-3-540-72502-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics