Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators

References

• Acemoglu D, Ozdaglar A (2007a) Competition and efficiency in congested markets. Math. Oper. Res. 32(1):1–31.Link, Google Scholar
• Acemoglu D, Ozdaglar A (2007b) Competition in parallel-serial networks. IEEE J. Selected Areas Comm. 25(6):1180–1192.Crossref, Google Scholar
• Anshelevich E, Sekar S (2015) Price competition in networked markets: How do monopolies impact social welfare. Proc. 11th Internat. Conf. Web Internet Econom. (Springer, Berlin, Heidelberg), 16–30.Google Scholar
• Aumann R (1959) Acceptable points in general cooperative n-person games. Luce RD, Tucker AW, eds. Contributions to the Theory of Games, vol. 4 (Princeton University Press, Princeton, NJ), 287–324.Google Scholar
• Beckmann M, McGuire C, Winsten C (1956) Studies in the Economics of Transportation (Yale University Press, New Haven, CT).Google Scholar
• Berge C (1963) Topological Spaces: Including a Treatment of Multi-valued Functions, Vector Spaces, and Convexity, Dover Books on Mathematics (Dover Publications, Mineola).Google Scholar
• Bonifaci V, Salek M, Schäfer G (2011) Efficiency of restricted tolls in non-atomic network routing games. Proc. 4th Internat. Sympos. Algorithmic Game Theory (Springer, Berlin, Heidelberg), 302–313.Google Scholar
• Briest P, Hoefer M, Krysta P (2012) Stackelberg network pricing games. Algorithmica 62(3):733–753.Google Scholar
• Caragiannis I, Chatzigeorgiou X, Kanellopoulos P, Krimpas G, Protopapas N, Voudouris A (2017) Efficiency and complexity of price competition among single-product vendors. Artificial Intelligence 248:9–25.Crossref, Google Scholar
• Castelli L, Labbé M, Violin A (2017) Network pricing problem with unit toll. Networks 69(1):83–93.Crossref, Google Scholar
• Chawla S, Niu F (2009) The price of anarchy in Bertrand games. Proc. 10th ACM Conf. Electronic Commerce (ACM, New York), 305–314.Google Scholar
• Chawla S, Niu F, Roughgarden T (2008) Bertrand competition in networks. Proc. First Internat. Sympos. Algorithmic Game Theory (Springer, Berlin, Heidelberg), 70–82.Google Scholar
• Cole R, Dodis Y, Roughgarden T (2003) Pricing network edges for heterogeneous selfish users. Proc. 35th ACM Sympos. Theory Comput. (ACM, New York), vol. 3, 444–467.Google Scholar
• Correa J, Stier-Moses N (2011) Wardrop equilibria. Wiley Encyclopedia of Operations Research and Management Science (Wiley, Hoboken, NJ).Google Scholar
• Dial R (1999) Minimal-revenue congestion pricing part i: A fast algorithm for the single-origin case. Transportation Res. Part B: Methodological 33(3):189–202.Crossref, Google Scholar
• Dixon H (2001) Surfing Economics: Essays for the Inquiring Economist (Palgrave Macmillan, New York).Crossref, Google Scholar
• Fleischer L (2005) Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theoretical Comput. Sci. 348:217–225.Crossref, Google Scholar
• Fotakis D, Kalimeris D, Lianeas T (2015) Improving selfish routing for risk-averse players. Proc. 11th Internat. Conf. Web Internet Econom. (Springer, Berlin, Heidelberg), 328–342.Google Scholar
• Gonzalez A (2016) Controversias por reducciones en la demanda en las concesiones de carreteras en chile. Revista de Derecho Económico 76:61–97.Google Scholar
• Hall MA (1978) Properties of the equilibrium state in transportation networks. Transportation Sci. 12(3):208–216.Link, Google Scholar
• Harks T, Schröder M, Vermeulen D (2019) Toll caps in privatized road networks. Eur. J. Oper. Res. 276(3):947–956.Crossref, Google Scholar
• Hayrapetyan A, Tardos E, Wexler T (2007) A network pricing game for selfish traffic. Distributed Comput. 19(4):255–266.Crossref, Google Scholar
• Jelinek T, Klaas M, Schäfer G (2014) Computing optimal tolls with arc restrictions and heterogeneous players. Proc. 31th Internat. Sympos. Theoretical Aspects Comput. Sci. (Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik).Google Scholar
• Johari R, Weintraub G, Van Roy B (2010) Investment and market structure in industries with congestion. Oper. Res. 58(5):1303–1317.Link, Google Scholar
• Kleer P, Schäfer G (2016) The impact of worst-case deviations in non-atomic network routing games. Proc. Ninth Internat. Sympos. Algorithmic Game Theory (Springer, Berlin, Heidelberg), 129–140.Google Scholar
• Kuiteing A, Marcotte P, Savard G (2016) Network pricing of congestion-free networks: The elastic and linear demand case. Transportation Sci. 51(3):791–806.Link, Google Scholar
• Lin H, Roughgarden T, Tardos E (2004) A stronger bound on Braess’s paradox. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 333–334.Google Scholar
• Lin H, Roughgarden T, Tardos E, Walkover A (2011) Stronger bounds on Braess’s paradox and the maximum latency of selfish routing. SIAM J. Discrete Math. 25(4):1667–1686.Crossref, Google Scholar
• Meng Q, Lu Z (2017) Quantitative analyses of highway franchising under build-operate-transfer scheme: Critical review and future research directions. Transportation Res. Part B: Methodological 102:105–123.Crossref, Google Scholar
• Musacchio J (2009) The price of anarchy in parallel-serial competition with elastic demand. Technical Report No. UCSC-SOE-09-20, Baskin School of Engineering, University of California, Santa Cruz.Google Scholar
• Musacchio J, Wu S (2007) The price of anarchy in a network pricing game. Proc. Allerton Conf. (ACM, New York).Google Scholar
• Nikolova E, Stier-Moses N (2015) The burden of risk aversion in mean-risk selfish routing. Proc. 16th ACM Conf. Econom. Comput. (ACM, New York), 489–506.Google Scholar
• Ozdaglar A (2008) Price competition with elastic traffic. Networks 52(3):141–155.Crossref, Google Scholar
• Ozdaglar A, Srikant R (2007) Incentives and pricing in communication networks. Algorithmic Game Theory (Cambridge University Press, New York), 571–591.Crossref, Google Scholar
• Papadimitriou C, Valiant G (2010) A new look at selfish routing. Proc. Internat. Comput. Sympos., 178–187.Google Scholar
• Roughgarden T (2005) Selfish Routing and the Price of Anarchy (MIT Press, Cambridge, MA).Google Scholar
• Roughgarden T (2006) On the severity of Braess’s paradox: Designing networks for selfish users is hard. J. Comput. System Sci. 72(5):922–953.Crossref, Google Scholar
• Roughgarden T, Tardos E (2002) How bad is selfish routing? J. ACM 49(2):236–259.Crossref, Google Scholar
• Schmand D, Schröder M, Skopalik A (2019) Network investment games with Wardrop followers. Baier C, Chatzigiannakis I, Flocchini P, Leonardi S, eds. 46th Internat. Colloquium Automata, Languages, Programming, vol. 132, 151:1–151:14.Google Scholar
• Yang H, Meng Q (2000) Highway pricing and capacity choice in a road network under a build–operate–transfer scheme. Transportation Res. Part A: Policy Practice 24(3):207–222.Crossref, Google Scholar
• Yang H, Tang W, Cheung W, Meng Q (2002) Profitability and welfare gain of private toll roads in a network with heterogeneous users. Transportation Res. Part A: Policy Practice 36(6):537–554.Crossref, Google Scholar