Stackelberg Max Closure with Multiple Followers

References

• [1] Alimonti P , Kann V (2000) Some APX-completeness results for cubic graphs. Theoretical Comput. Sci. 237(1–2):123–134.Crossref, Google Scholar
• [2] Baïou M , Barahona F (2016) Stackelberg bipartite vertex cover and the preflow algorithm. Algorithmica 74(3):1174–1183.Crossref, Google Scholar
• [3] Balcan MF , Blum A , Mansour Y (2008) Item pricing for revenue maximization. Proc. Ninth ACM Conf. Electronic Commerce (ACM, New York), 50–59.Google Scholar
• [4] Bilò D , Gualà L , Proietti G , Widmayer P (2008) Computational aspects of a 2-player Stackelberg shortest paths tree game. Internat. Workshop Internet Network Econom. (Springer, Berlin, Heidelberg), 251–262.Google Scholar
• [5] Böhnlein T , Kratsch S , Schaudt O (2021) Revenue maximization in Stackelberg pricing games: Beyond the combinatorial setting. Math. Programming 187(1):653–695.Google Scholar
• [6] Böhnlein T , Schaudt O , Schauer J (2019) Stackelberg packing games. Workshop Algorithms Data Structures (Springer, Cham, Switzerland), 239–253.Google Scholar
• [7] Briest P , Hoefer M , Krysta P (2012) Stackelberg network pricing games. Algorithmica 62(3):733–753.Crossref, Google Scholar
• [8] Briest P , Chalermsook P , Khanna S , Laekhanukit B , Nanongkai D (2010) Improved hardness of approximation for Stackelberg shortest-path pricing. Internat. Workshop Internet Network Econom. (Springer, Berlin, Heidelberg), 444–454.Google Scholar
• [9] Cabello S (2012) Stackelberg shortest path tree game, revisited. Preprint, submitted July 10, https://arxiv.org/abs/1207.2317.Google Scholar
• [10] Cardinal J , Demaine ED , Fiorini S , Joret G , Langerman S , Newman I , Weimann O (2011) The Stackelberg minimum spanning tree game. Algorithmica 59(2):129–144.Crossref, Google Scholar
• [11] Cristi A , Schröder M (2022) Negative prices in network pricing games. Oper. Res. Lett. 50(2):99–106.Google Scholar
• [12] Hochbaum DS (2001) A new–old algorithm for minimum-cut and maximum-flow in closure graphs. Networks 37(4):171–193.Crossref, Google Scholar
• [13] Joret G (2011) Stackelberg network pricing is hard to approximate. Networks 57(2):117–120.Google Scholar
• [14] Karp RM (1972) Reducibility Among Combinatorial Problems. Miller RE, Thatcher JW, Bohlinger JD, eds. Complexity of Computer Computations. The IBM Res. Sympos. Ser. (Springer, Boston), 85–103.Google Scholar
• [15] Kőnig D (1931) Gráfok és mátrixok. Matematikai és Fizikai Lapok 38:116–119.Google Scholar
• [16] Labbé M , Marcotte P , Savard G (1998) A bilevel model of taxation and its application to optimal highway pricing. Management Sci. 44(12):1608–1622.Link, Google Scholar
• [17] Papadimitriou CH , Yannakakis M (1991) Optimization, approximation, and complexity classes. J. Comput. System Sci. 43(3):425–440.Crossref, Google Scholar
• [18] Phillips C , Warnow TJ (1996) The asymmetric median tree—A new model for building consensus trees. Discrete Appl. Math. 71(1–3):311–335.Crossref, Google Scholar
• [19] Picard JC (1976) Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22(11):1268–1272.Link, Google Scholar
• [20] Roch S , Savard G , Marcotte P (2005) An approximation algorithm for Stackelberg network pricing. Networks 46(1):57–67.Crossref, Google Scholar
• [21] Van Hoesel S (2008) An overview of Stackelberg pricing in networks. Eur. J. Oper. Res. 189(3):1393–1402.Crossref, Google Scholar
• [22] Von Stackelberg H (1934) Marktform und Gleichgewicht (Springer, Vienna).Google Scholar