Skip to main content

Revenue Maximization with Nonexcludable Goods

  • Conference paper
Web and Internet Economics (WINE 2013)

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

Included in the following conference series:

Abstract

We study the design of revenue maximizing mechanisms for selling nonexcludable public goods. In particular, we study revenue maximizing mechanisms in Bayesian settings for facility location problems on graphs where no agent can be excluded from using a facility that has been constructed. We show that the optimization problem involved in implementing the revenue optimal mechanism is hard to approximate within a factor of Ω(n 2 − ε) (assuming P ≠ NP) even in star graphs, and that even in expectation over the valuation profiles, the problem is APX-hard. However, in a relevant special case we construct polynomial time truthful mechanisms that approximate the optimal expected revenue within a constant factor. We also study the effect of partially mitigating nonexcludability by collecting tolls for using the facilities. We show that such “posted-price” mechanisms obtain significantly higher revenue, and often approach the optimal revenue obtainable with full excludability.

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. Aggarwal, G., Feldman, J., Muthukrishnan, S., Pál, M.: Sponsored search auctions with markovian users. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 621–628. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Akhlaghpour, H., Ghodsi, M., Haghpanah, N., Mirrokni, V.S., Mahini, H., Nikzad, A.: Optimal iterative pricing over social networks (Extended abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 415–423. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Anari, N., Ehsani, S., Ghodsi, M., Haghpanah, N., Immorlica, N., Mahini, H., Mirrokni, V.S.: Equilibrium pricing with positive externalities (Extended abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 424–431. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Athey, S., Ellison, G.: Position auctions with consumer search. The Quarterly Journal of Economics 126(3), 1213–1270 (2011)

    Article  MATH  Google Scholar 

  5. Candogan, O., Bimpikis, K., Ozdaglar, A.: Optimal pricing in the presence of local network effects. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 118–132. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Catlin, P.A., Lai, H.-J., Shao, Y.: Edge-connectivity and edge-disjoint spanning trees. Discrete Mathematics 309(5), 1033–1040 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Deng, C., Pekec, S.: Money for nothing: exploiting negative externalities. In: Proceedings of the ACM Conference on Electronic Commerce (EC), pp. 361–370 (2011)

    Google Scholar 

  8. Giotis, I., Karlin, A.R.: On the equilibria and efficiency of the GSP mechanism in keyword auctions with externalities. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 629–638. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Gomes, R., Immorlica, N., Markakis, E.: Externalities in keyword auctions: An empirical and theoretical assessment. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 172–183. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Haghpanah, N., Immorlica, N., Mirrokni, V., Munagala, K.: Optimal auctions with positive network externalities. In: Proceedings of the 12th ACM Conference on Electronic Commerce, EC 2011, pp. 11–20 (2011)

    Google Scholar 

  11. Hartline, J., Mirrokni, V., Sundararajan, M.: Optimal marketing strategies over social networks. In: Proceedings of the 17th International Conference on World Wide Web, pp. 189–198. ACM (2008)

    Google Scholar 

  12. Jeziorski, P., Segal, I., et al.: What makes them click: Empirical analysis of consumer demand for search advertising. SSRN eLibrary 33 (2009)

    Google Scholar 

  13. Kempe, D., Mahdian, M.: A cascade model for externalities in sponsored search. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 585–596. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Myerson, R.B.: Optimal Auction Design. Mathematics of Operations Research 6(1), 58–73 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rohlfs, J.: A theory of interdependent demand for a communications service. The Bell Journal of Economics and Management Science, 16–37 (1974)

    Google Scholar 

  16. Roskind, J., Tarjan, R.E.: A note on finding minimum-cost edge-disjoint spanning trees. Mathematics of Operations Research 10(4), 701–708 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bateni, M., Haghpanah, N., Sivan, B., Zadimoghaddam, M. (2013). Revenue Maximization with Nonexcludable Goods. In: Chen, Y., Immorlica, N. (eds) Web and Internet Economics. WINE 2013. Lecture Notes in Computer Science, vol 8289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45046-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45046-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45045-7

  • Online ISBN: 978-3-642-45046-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics