Fare Evasion in Transit Networks

References

• Acemoglu D, Ozdaglar AE (2007) Competition and efficiency in congested markets. Math. Oper. Res. 32(1):1–31.Link, Google Scholar
• Borndörfer R, Sagnol G, Swarat E (2012b) A case study on optimizing toll enforcements on motorways. Ravizza S, Holborn PL, eds. Proc. 3rd Student Conf. Oper. Res. Schloss Dagstuhl—Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 1–10.Google Scholar
• Borndörfer R, Omont B, Sagnol G, Swarat E (2012a) A Stackelberg game to optimize the distribution of controls in transportation networks. Proc. 3rd Internat. Conf. Game Theory for Networks (Springer, Berlin), 236–247.Crossref, Google Scholar
• Borndörfer R, Buwaya J, Sagnol G, Swarat E (2013) Optimizing toll enforcement in transportation networks: A game-theoretic approach. Electronic Notes in Discrete Math. 41:253–260.Crossref, Google Scholar
• Bouhtou M, Grigoriev A, van Hoesel S, van der Kraaij AF, Spieksma FCR, Uetz M (2007) Pricing bridges to cross a river. Naval Res. Logist. 54(4):411–420.Crossref, Google Scholar
• Briest P, Hoefer M, Krysta P (2012) Stackelberg network pricing games. Algorithmica 62(3–4):733–753.Crossref, Google Scholar
• Brotcorne L, Labbé M, Marcotte P, Savard G (2001) A bilevel model for toll optimization on a multicommodity transportation network. Transportation Sci. 35(4):345–358.Link, Google Scholar
• Brotcorne L, Labbé M, Marcotte P, Savard G (2008) Joint design and pricing on a network. Oper. Res. 56(5):1104–1115.Link, Google Scholar
• Carstensen PJ (1983) The complexity of some problems in parametric linear and combinatorial programming. Ph.D. thesis, University of Michigan.Google Scholar
• Chilean Subsecretary of Transportation (2014) Fare evasion in Transantiago. http://www.fiscalizacion.cl/index.php/evasion-de-transantiago-alcanza-192-y-registra-nivel-mas-bajo-desde-diciembre-de-2010/.Google Scholar
• Cole R, Dodis Y, Roughgarden T (2006) Bottleneck links, variable demand, and the tragedy of the commons. Proc. Seventeenth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’06 (ACM, New York), 668–677.Crossref, Google Scholar
• Denise A, Vasconcellos M, Welsh DJA (1996) The random planar graph. Congressus Numerantium 113:61–79.Google Scholar
• Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271.Crossref, Google Scholar
• Dutch Railways (2014) NS tarieven (Dutch tariff regulations). http://www.ns.nl/reizigers/klantenservice/klantenservice/tarieven.Google Scholar
• Gijsbers BCM (2013) Directeur Openbaar Vervoer en Spoor, Private communication.Google Scholar
• Gómez-Lobo A (2012) The ups and downs of a public transport reform: The case of Transantiago. Technical report, Universidad de Chile, Santiago, Chile.Google Scholar
• Gondran M, Minoux M, Vajda S (1984) Graphs and Algorithms (John Wiley & Sons, New York).Google Scholar
• Henzinger MR, Klein P, Rao S, Subramanian S (1997) Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55(1):3–23.Crossref, Google Scholar
• Jain M, Conitzer V, Tambe M (2013) Security scheduling for real-world networks. Proc. 2013 Internat. Conf. Autonomous Agents and Multi-agent Systems (IFAAMAS, Richland, SC), 215–222.Google Scholar
• Klinz B, Woeginger GJ (2004) Minimum-cost dynamic flows: The series-parallel case. Networks 43(3):153–162.Crossref, Google Scholar
• 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
• Lin KY, Atkinson MP, Chung TH, Glazebrook KD (2013) A graph patrol problem with random attack times. Oper. Res. 61(3):694–710.Link, Google Scholar
• Lorenz DH, Raz D (2001) A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5): 213–219.Crossref, Google Scholar
• Nikolova E, Kelner JA, Brand M, Mitzenmacher M (2006) Stochastic shortest paths via quasi-convex maximization. Azar Y, Erlebach T, eds. Proc. 14th Annual European Sympos. Algorithms, ESA ’06 (Springer, Berlin), 552–563.Crossref, Google Scholar
• Nikolova EV (2009) Strategic algorithms. Ph.D. thesis, Massachusetts Institute of Technology.Google Scholar
• Roch S, Savard G, Marcotte P (2005) An approximation algorithm for Stackelberg network pricing. Networks 46(1):57–67.Crossref, Google Scholar
• Tambe M (2012) Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned (Cambridge University Press, New York).Google Scholar
• Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math. Programming 103(2):225–249.Crossref, Google Scholar
• Torres-Montoya M (2014) Tackling fare evasion in Transantiago: An integrated approach. Transportation Res. Board 93rd Annual Meeting (Transportation Research Board, Washington, DC).Google Scholar
• Transport for London (2010) Bus fare evasion communications development. Technical report, Transport for London. http://www.tfl.gov.uk/assets/downloads/customer-research/bus-fare-evasion-communications-development-presentation.pdf.Google Scholar
• Von Ferber C, Holovatch T, Holovatch Y, Palchykov V (2009) Public transport networks: Empirical analysis and modeling. Eur. Physical J. B 68(2):261–275.Crossref, Google Scholar
• Washburn A, Wood K (1995) Two-person zero-sum games for network interdiction. Oper. Res. 43(2):243–251.Link, Google Scholar
• Wayne KD (1999) Generalized maximum flow algorithms. Ph.D. thesis, Cornell University, Ithaca, NY.Google Scholar
• Yin Z, Jiang AX, Johnson MP, Kiekintveld C, Leyton-Brown K, Sandholm T, Tambe M, Sullivan JP (2012) TRUSTS: Scheduling randomized patrols for fare inspection in transit systems. Fromherz MPJ, Munoz-Avila H, eds. Proc. 24th Conf. Innovative Applications of Artificial Intelligence (AAAI, Palo Alto, CA), 2348–2355.Google Scholar