Skip to main content

Welfare and Revenue Guarantees for Competitive Bundling Equilibrium

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9470))

Abstract

Competitive equilibrium, the central equilibrium notion in markets with indivisible goods, is based on pricing each good such that the demand for goods equals their supply and the market clears. This equilibrium notion is not guaranteed to exist beyond the narrow case of substitute goods, might result in zero revenue even when consumers value the goods highly, and overlooks the widespread practice of pricing bundles rather than individual goods. Alternative equilibrium notions proposed to address these shortcomings have either made a strong assumption on the ability to withhold supply in equilibrium, or have allowed an exponential number of prices.

In this paper we study the notion of competitive bundling equilibrium – a competitive equilibrium over the market induced by partitioning the goods into bundles. Such an equilibrium is guaranteed to exist, is succinct, and satisfies the fundamental economic condition of market clearance. We establish positive welfare and revenue guarantees for this solution concept: For welfare we show that in markets with homogeneous goods, there always exists a competitive bundling equilibrium that achieves a logarithmic fraction of the optimal welfare. We also extend this result to establish nontrivial welfare guarantees for markets with heterogeneous goods. For revenue we show that in a natural class of markets for which competitive equilibrium does not guarantee positive revenue, there always exists a competitive bundling equilibrium that extracts as revenue a logarithmic fraction of the optimal welfare. Both results are tight.

S. Dobzinski—Incumbent of the Lilian and George Lyttle Career Development Chair. Supported in part by the I-CORE program of the planning and budgeting committee and the Israel Science Foundation 4/11 and by EU CIG grant 618128.

M. Feldman—partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007–2013)/ERC grant agreement number 337122.

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

Notes

  1. 1.

    In the full version available on arXiv.org we use linear programming to show that our solution concept actually applies more widely than this one.

  2. 2.

    To emphasize this distinction we propose a different name – competitive bundling equilibrium – for the solution concept we focus on in this paper.

  3. 3.

    The classes addressed in [9] are a strict subclass of budget-additive valuations, and superadditive valuations. We provide a general treatment of budget-additive valuations in the full version of this paper [6], and re-derive the result for super-additive valuations as a corollary of a more general argument in the full version: It was observed in [19] that the linear program introduced by [3] has an integrality gap of 1 for superadditive valuations, guaranteeing the existence of non-linear supporting prices; we show that an integrality gap of 1 also implies the existence of a competitive bundling equilibrium with optimal welfare.

  4. 4.

    An interesting future direction is trying to better understand the market processes leading to such bundling.

  5. 5.

    This shows that even for slightly more complicated valuations than those considered by Vickrey, not only is it the case that a standard competitive equilibrium may not exist, but also no competitive bundling equilibrium necessarily provides a constant fraction of the optimal welfare. In the full version we also show that randomization – in the form of correlated lotteries – does not improve the logarithmic approximation factor. This tight and robust bound can be seen as a kind of price of stability result, which establishes a clear separation between the optimal welfare and the optimal stable welfare in markets with indivisible items.

  6. 6.

    i.e., a coarser bundling of the original m items.

  7. 7.

    A tractable algorithm for multi-unit market runs in time \({\text {poly}}(\log m,n)\) and not \({\text {poly}}(m,n)\) – see [7].

References

  1. Ausubel, L., Milgrom, P.: Ascending auctions with package bidding. B.E. J. Theoret. Econ. 1(1), 1–44 (2002)

    Article  MathSciNet  Google Scholar 

  2. Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94, 1452–1475 (2004)

    Article  Google Scholar 

  3. Bikhchandani, S., Ostroy, J.M.: The package assignment model. J. Econ. Theory 107, 377–406 (2002)

    Article  MathSciNet  Google Scholar 

  4. Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: Proceedings of 7th ACM Conference on Electronic Commerce (EC) (2005)

    Google Scholar 

  5. Coase, R.H.: Durability and monopoly. J. Law Econ. 15(1), 143–149 (1972)

    Article  Google Scholar 

  6. Dobzinski, S., Feldman, M., Talgam-Cohen, I., Weinstein, O.: Welfare and revenue guarantees for competitive bundling equilibrium. CoRR abs/1406.0576 (2014). http://arxiv.org/abs/1406.0576

  7. Dobzinski, S., Nisan, N.: Mechanisms for multi-unit auctions. J. Artif. Intell. Res. 37, 85–98 (2010)

    Article  MathSciNet  Google Scholar 

  8. Feldman, M., Gravin, N., Lucier, B.: Combinatorial walrasian equilibrium. In: Proceedings of 44th ACM Symposium on Theory of Computing (STOC), pp. 61–70 (2013)

    Google Scholar 

  9. Feldman, M., Lucier, B.: Clearing markets via bundles. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 158–169. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  10. Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. J. Econ. Theory 87(1), 95–124 (1999)

    Article  MathSciNet  Google Scholar 

  11. Lahaie, S., Parkes, D.C.: Fair package assignment. In: Das, S., Ostrovsky, M., Pennock, D., Szymanksi, B. (eds.) AMMA 2009. LNICST, vol. 14, pp. 92–92. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270–296 (2006)

    Article  MathSciNet  Google Scholar 

  13. Manelli, A.M., Vincent, D.R.: Bundling as an optimal selling mechanism for a multiple-good monopolist. J. Econ. Theory 127, 1–35 (2006)

    Article  MathSciNet  Google Scholar 

  14. Mas-Collel, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    Google Scholar 

  15. Maskin, E., Riley, J.: Optimal multi-unit auctions. In: Hahn, F. (ed.) The Economics of Missing Markets, Information, and Games, pp. 312–335. Oxford University Press, Oxford (1989)

    Google Scholar 

  16. Milgrom, P.: Putting Auction Theory to Work. Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

  17. Nisan, N.: Survey: algorithmic mechanism design (through the lens of multi-unit auctions). In: Young, P., Zamir, S. (eds.) Handbook of Game Theory, vol. 4, chap. 9. Elsevier, Amsterdam (2014)

    Google Scholar 

  18. Parkes, D.: Iterative combinatorial auctions. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions, chap. 2. MIT Press, Cambridge (2006)

    Google Scholar 

  19. Parkes, D.C.: iBundle: an efficient ascending price bundle auction. In: Proceedings of 1st ACM Conference on Electronic Commerce (EC), pp. 148–157 (1999)

    Google Scholar 

  20. Parkes, D.C., Ungar, L.H.: Iterative combinatorial auctions: theory and practice. In: Proceedings of the 17th National Conference on Artificial Intelligence, AAAI 2000, pp. 74–81 (2000)

    Google Scholar 

  21. Parkes, D.C., Ungar, L.H.: An ascending-price generalized Vickrey auction. In: Proceedings of Stanford Institute for Theoretical Economics Workshop on The Economics of the Internet, Stanford, CA (2002)

    Google Scholar 

  22. Sun, N., Yang, Z.: An efficient and incentive compatible dynamic auction for multiple complements. J. Polit. Econ. (2014, to appear)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  24. Vohra, R.V.: Mechanism Design: A Linear Programming Approach (Econometric Society Monographs). Cambridge University Press, Cambridge (2011)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Omri Weinstein .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dobzinski, S., Feldman, M., Talgam-Cohen, I., Weinstein, O. (2015). Welfare and Revenue Guarantees for Competitive Bundling Equilibrium. In: Markakis, E., Schäfer, G. (eds) Web and Internet Economics. WINE 2015. Lecture Notes in Computer Science(), vol 9470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48995-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48995-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48994-9

  • Online ISBN: 978-3-662-48995-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics