SAGT 2012: Algorithmic Game Theory pp 227-238 | Cite as

Uniform Price Auctions: Equilibria and Efficiency

  • Evangelos Markakis
  • Orestis Telelis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7615)

Abstract

We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient multi-unit Vickrey auction, the Uniform Price Auction encourages strategic bidding and is socially inefficient in general, partly due to a ”Demand Reduction” effect; bidders tend to bid for fewer (identical) units, so as to receive them at a lower uniform price. Despite its inefficiency, the uniform pricing rule is widely popular by its appeal to the natural anticipation, that identical items should be identically priced. Application domains of its variants include sales of U.S. Treasury bonds to investors, trade exchanges over the internet facilitated by popular online brokers, allocation of radio spectrum licenses etc. In this work we study equilibria of the Uniform Price Auction in undominated strategies. We characterize a class of undominated pure Nash equilibria and quantify the social inefficiency of pure and (mixed) Bayes-Nash equilibria by means of bounds on the Price of Anarchy.

Keywords

Valuation Function Combinatorial Auction Price Auction Pure Nash Equilibrium Demand Reduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ausubel, L., Cramton, P.: Demand Reduction and Inefficiency in Multi-Unit Auctions. Tech. rep., University of Maryland (2002)Google Scholar
  2. 2.
    Bhawalkar, K., Roughgarden, T.: Welfare Guarantees for Combinatorial Auctions with Item Bidding. In: Proceedings of the ACM-SIAM Symposium on Disctrete Algorithms, SODA, pp. 700–709 (2011)Google Scholar
  3. 3.
    Bresky, M.: Pure Equilibrium Strategies in Multi-unit Auctions with Private Value Bidders. Tech. Rep. 376, Center for Economic Research & Graduate Education - Economics Institute (CERGE-EI), Czech Republic (2008)Google Scholar
  4. 4.
    Caragiannis, I., Kaklamanis, K., Kanellopoulos, P., Kyropoulou, M., Lucier, B., Paes Leme, R., Tardos, E.: On the efficiency of equilibria in generalized second price auctions. arxiv:1201.6429 (2012)Google Scholar
  5. 5.
    Christodoulou, G., Kovács, A., Schapira, M.: Bayesian Combinatorial Auctions. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 820–832. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Clarke, E.H.: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)CrossRefGoogle Scholar
  7. 7.
    Dobzinski, S., Nisan, N.: Mechanisms for Multi-Unit Auctions. Journal of Artificial Intelligence Research 37, 85–98 (2010)MathSciNetMATHGoogle Scholar
  8. 8.
    Edelman, B., Ostrovsky, M., Schwartz, M.: Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords. The American Economic Review 97(1), 242–259 (2007)CrossRefGoogle Scholar
  9. 9.
    Engelbrecht-Wiggans, R., Kahn, C.M.: Multi-unit auctions with uniform prices. Economic Theory 12(2), 227–258 (1998)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Friedman, M.: A Program for Monetary Stability. Fordham University Press, New York (1960)Google Scholar
  11. 11.
    Hassidim, A., Kaplan, H., Mansour, Y., Nisan, N.: Non-price equilibria in markets of discrete goods. In: Proceedings of the ACM Conference on Electronic Commerce, EC, pp. 295–296 (2011)Google Scholar
  12. 12.
    Kittsteiner, T., Ockenfels, A.: On the Design of Simple Multi-unit Online Auctions. In: Jennings, N., Kersten, G., Ockenfels, A., Weinhardt, C. (eds.) Negotiation and Market Engineering. Dagstuhl Seminar Proceedings, vol. 06461. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2007), http://drops.dagstuhl.de/opus/volltexte/2007/1005Google Scholar
  13. 13.
    Krishna, V.: Auction Theory. Academic Press (April 2002)Google Scholar
  14. 14.
    Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55(2), 270–296 (2006)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Leme, R.P., Syrgkanis, V., Tardos, E.: Sequential auctions and externalities. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 869–886 (2012)Google Scholar
  16. 16.
    Lucier, B., Borodin, A.: Price of Anarchy for Greedy Auctions. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 537–553 (2010)Google Scholar
  17. 17.
    Milgrom, P.: Putting Auction Theory to Work, Cambridge (2004)Google Scholar
  18. 18.
    Mu’alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. Games and Economic Behavior 64(2), 612–631 (2008)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Noussair, C.: Equilibria in a multi-object uniform price sealed bid auction with multi-unit demands. Economic Theory 5, 337–351 (1995)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Ockenfels, A., Reiley, D.H., Sadrieh, A.: Economics and Information Systems. In: Handbooks in Information Systems, Online Actions, vol. 1, ch. 12, pp. 571–628. Elsevier Science (December 2006)Google Scholar
  21. 21.
    Reny, P.J.: On the existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games. Econometrica 67, 1029–1056 (1999)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    U.S. Dept. of Treasury: Uniform-price auctions: Update of the treasury experience, office of market finance (1998), http://www.treasury.gov/domfin
  23. 23.
    Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance 16(1), 8–37 (1961)CrossRefGoogle Scholar
  24. 24.
    Vöcking, B.: A universally-truthful approximation scheme for multi-unit auctions. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 846–855 (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Evangelos Markakis
    • 1
  • Orestis Telelis
    • 2
  1. 1.Dept. of InformaticsAthens University of Economics and BusinessGreece
  2. 2.Dept. of Computer ScienceThe University of LiverpoolUnited Kingdom

Personalised recommendations