Document Open Access Logo

Selling Complementary Goods: Dynamics, Efficiency and Revenue

Authors Moshe Babaioff, Liad Blumrosen, Noam Nisan

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2017.134.pdf
  • Filesize: 0.5 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • Complements
  • Pricing
  • Networks
  • Game Theory
  • Price of Stability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We consider a price competition between two sellers of perfect-complement goods. Each seller posts a price for the good it sells, but the demand is determined according to the sum of prices. This is a classic model by Cournot (1838), who showed that in this setting a monopoly that sells both goods is better for the society than two competing sellers.

We show that non-trivial pure Nash equilibria always exist in this game. We also quantify Cournot's observation with respect to both the optimal welfare and the monopoly revenue. We then prove a series of mostly negative results regarding the convergence of best response dynamics to equilibria in such games.

Cite As Get BibTex

Moshe Babaioff, Liad Blumrosen, and Noam Nisan. Selling Complementary Goods: Dynamics, Efficiency and Revenue. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 134:1-134:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.ICALP.2017.134

Author Details

Moshe Babaioff
Liad Blumrosen
Noam Nisan

References

  1. Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The price of stability for network design with fair cost allocation. SIAM J. Comput., 38(4):1602-1623, 2008. Google Scholar
  2. Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, and Alexander Skopalik. Fast convergence to nearly optimal solutions in potential games. In Proceedings 9th ACM Conference on Electronic Commerce (EC08), pages 264-273, 2008. Google Scholar
  3. Moshe Babaioff, Liad Blumrosen, and Noam Nisan. Network of complements. In The 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016)., 2016. Google Scholar
  4. Moshe Babaioff, Brendan Lucier, and Noam Nisan. Bertrand networks. In ACM Conference on Electronic Commerce (ACM-EC), 2013. Google Scholar
  5. Joseph Louis François Bertrand. theorie mathematique de la richesse sociale. Journal de Savants, 67:499–508, 1883. Google Scholar
  6. James M. Buchanan and Yong J. Yoon. Symmetric tragedies; commons and anticommons. Journal of Law and Economics, 43(1):1-13, 2000. Google Scholar
  7. Shuchi Chawla and Feng Niu. The price of anarchy in bertrand games. In Proceedings of the 10th ACM Conference on Electronic Commerce, EC '09, pages 305-314, 2009. Google Scholar
  8. Shuchi Chawla and Tim Roughgarden. Bertrand competition in networks. In Burkhard Monien and Ulf-Peter Schroeder, editors, Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings, volume 4997 of Lecture Notes in Computer Science, pages 70-82. Springer, 2008. URL: http://dx.doi.org/10.1007/978-3-540-79309-0_8.
  9. Antoine Augustin Cournot. Recherches sur les principes mathematiques de la theori des Richesses. Paris : L. Hachette, 1838. Google Scholar
  10. Nicholas Economides and Evangelos Katsamakas. Two-sided competition of proprietary vs. open source technology platforms and the implications for the software industry. Managment Science, 52(7):1057–1071, 2006. Google Scholar
  11. Nicholas Economides and Steven C. Salop. Competition and integration among complements, and network market structure. The Journal of Industrial Economics, 40(1):105-123, 1992. Google Scholar
  12. C. Ellet. An essay on the laws of trade in reference to the works of internal improvement in the United States. Reprints of economic classics. A.M. Kelley, 1839. URL: https://books.google.co.il/books?id=Fu4ZAAAAMAAJ.
  13. Alex Fabrikant, Christos H. Papadimitriou, and Kunal Talwar. The complexity of pure nash equilibria. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 604-612, 2004. Google Scholar
  14. Yossi Feinberg and Morton I. Kamien. Highway robbery: complementary monopoly and the hold-up problem. International Journal of Industrial Organization, 19(10):1603 - 1621, 2001. Google Scholar
  15. Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, and Svetlana Olonetsky. Beyond myopic best response (in cournot competition). Games and Economic Behavior, to appear., 2013. Google Scholar
  16. Jason Hartline, Darrell Hoy, and Sam Taggart. Price of anarchy for auction revenue. In Proceedings of the Fifteenth ACM Conference on Economics and Computation, EC '14, pages 693-710, 2014. Google Scholar
  17. Michael A. Heller. The tragedy of the anticommons: Property in the transition from marx to markets. Harvard Law Review, 111:621 - 688, 1998. Google Scholar
  18. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 404-413, 1999. Google Scholar
  19. Uri Nadav and Georgios Piliouras. No regret learning in oligopolies: Cournot vs. bertrand. In Spyros C. Kontogiannis, Elias Koutsoupias, and Paul G. Spirakis, editors, Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings, volume 6386 of Lecture Notes in Computer Science, pages 300-311. Springer, 2010. URL: http://dx.doi.org/10.1007/978-3-642-16170-4_26.
  20. Noam Nisan, Michael Schapira, Gregory Valiant, and Aviv Zohar. Best-response mechanisms. In Innovations in Computer Science - ICS 2010, pages 155-165, 2011. Google Scholar
  21. Francesco Parisi, Norbert Schulz, and Ben Depoorter. Duality in property: Commons and anticommons. International Review of Law and Economics, 25(4):578 - 591, 2005. Google Scholar
  22. T. Roughgarden and Eva Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236 - 259, 2002. Google Scholar
  23. Tim Roughgarden. Intrinsic robustness of the price of anarchy. J. ACM, 62(5):32, 2015. Google Scholar
  24. Alexander Skopalik and Berthold Vöcking. Inapproximability of pure nash equilibria. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 355-364, 2008. Google Scholar
  25. Hugo Sonnenschein. The dual of duopoly is complementary monopoly: or, two of cournot’s theories are one. Journal of Political Economy, 76:316 - 318, 1968. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact