Skip to main content
Log in

Analyses of Cardinal Auctions

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We study cardinal auctions for selling multiple copies of a good, in which bidders specify not only their bid or how much they are ready to pay for the good, but also a cardinality constraint on the number of copies that will be sold via the auction. We perform first known Price of Anarchy type analyses with detailed comparison of the classical Vickrey-Clarke-Groves (VCG) auction and one based on minimum pay property (MPP) which is similar to Generalized Second Price auction commonly used in sponsored search. Without cardinality constraints, MPP has the same efficiency (total value to bidders) and at least as much revenue (total income to the auctioneer) as VCG; this also holds for certain other generalizations of MPP (e.g., prefix constrained auctions, as we show here). In contrast, our main results are that, with cardinality constraints,

  1. (a)

    equilibrium efficiency of MPP is 1/2 of that of VCG and this factor is tight, and

  2. (b)

    in equilibrium MPP may collect as little as 1/2 the revenue of VCG.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. http://www.technologyreview.com/web/25827/?a=f.

  2. http://www.bluekai.com/.

References

  1. Aseff, J., Chade, H.: An optimal auction with identity-dependent externalities. Rand J. Econ. 39(3), 731–746 (2008)

    Article  Google Scholar 

  2. Aggarwal, G., Feldman, J., Muthukrishnan, S.: Bidding to the top: VCG and equilibria of position-based auctions. In: Approximation and Online Algorithms, pp. 15–28 (2007)

    Chapter  Google Scholar 

  3. Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 1–7. ACM, New York (2006).

    Google Scholar 

  4. Broder, A., Ciaramita, M., Fontoura, M., Gabrilovich, E., Josifovski, V., Metzler, D., Murdock, V., Plachouras, V.: To swing or not to swing: learning when (not) to advertise. In: Proceeding of the 17th ACM Conference on Information and Knowledge Management, pp. 1003–1012. ACM, New York (2008).

    Google Scholar 

  5. Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17–33 (1971)

    Article  Google Scholar 

  6. Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second-price auction: selling billions of dollars worth of keywords. Am. Econ. Rev. 97(1), 242–259 (2007)

    Article  Google Scholar 

  7. Goldberg, A.V., Hartline, J.D.: Envy-free auctions for digital goods. In: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 29–35. ACM, New York (2003).

    Google Scholar 

  8. Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. Games Econ. Behav. 55(2), 242–269 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Groves, T.: Incentives in teams. Econometrica 41(4), 617–631 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ghosh, A., Sayedi, A.: Expressive auctions for externalities in online advertising. In: Proceedings of the 19th International Conference on World Wide Web, pp. 371–380. ACM, New York (2010).

    Chapter  Google Scholar 

  11. Haghpanah, N., Immorlica, N., Mirrokni, V.S., Munagala, K.: Optimal auctions with positive network externalities. In: ACM Conference on Electronic Commerce, pp. 11–20 (2011)

    Google Scholar 

  12. Jehiel, P., Moldovanu, B., Stacchetti, E.: How (not) to sell nuclear weapons. Am. Econ. Rev. 86(4), 814–829 (1996)

    Google Scholar 

  13. Jerath, K., Sayedi, A.: Exclusive Display in Sponsored Search Advertising. Social Science Research Network (2011)

    Google Scholar 

  14. Lucier, B., Paes Leme, R.: GSP auctions with correlated types. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 71–80. ACM, New York (2011).

    Chapter  Google Scholar 

  15. Leme, R.P., Tardos, E.: Pure and Bayes-Nash price of anarchy for generalized second price auction. In: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 735–744. IEEE Computer Society, Washington (2010).

    Chapter  Google Scholar 

  16. Muthukrishnan, S.: Bidding on configurations in Internet ad auctions. In: Computing and Combinatorics, pp. 1–6 (2009)

    Chapter  Google Scholar 

  17. Pei, J., Klabjan, D.: Approximations to auctions for digital goods with externality. Working paper (2012)

  18. Schroedl, S., Kesari, A., Nair, A., Neumeyer, L., Rao, S.: Generalized utility in web search advertising. In: Proceedings of the 4th International Workshop on Data Mining and Audience Intelligence for Advertising. ACM, New York (2010).

    Google Scholar 

  19. Shapley, L.S., Shubik, M.: The assignment game I: the core. Int. J. Game Theory 1(1), 111–130 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  20. Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8–37 (1961)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Darja Krushevskaja.

Additional information

This work was done while M.G. was graduate student at Rutgers University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupte, M., Krushevskaja, D. & Muthukrishnan, S. Analyses of Cardinal Auctions. Algorithmica 71, 889–903 (2015). https://doi.org/10.1007/s00453-013-9832-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-013-9832-x

Keywords

Navigation