Network Design Under Competition

[1]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[2]  Horst A. Eiselt,et al.  A bibliography for some fundamental problem categories in discrete location science , 2008, Eur. J. Oper. Res..

[3]  D. Serra,et al.  Competitive location in discrete space , 1994 .

[4]  Charles ReVelle,et al.  THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[5]  G. Stigler.  The Economics of Information , 1961, Journal of Political Economy.

[6]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[7]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[8]  U. Wen,et al.  A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem , 1996 .

[9]  A. Burgard,et al.  Optknock: A bilevel programming framework for identifying gene knockout strategies for microbial strain optimization , 2003, Biotechnology and bioengineering.

[10]  Athanasios Migdalas,et al.  Bilevel programming in traffic planning: Models, methods and challenge , 1995, J. Glob. Optim..

[11]  Justo Puerto,et al.  The path player game , 2008, Math. Methods Oper. Res..

[12]  Hanif D. Sherali,et al.  The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches , 2008, Comput. Optim. Appl..

[13]  Frank Plastria,et al.  Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..

[14]  H. A. Eiselt,et al.  Sequential Location Models , 2011 .

[15]  Jonathan F. Bard,et al.  A bilevel programming approach to determining tax credits for biofuel production , 2000, Eur. J. Oper. Res..

[16]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[17]  Heinrich von Stackelberg.  Market Structure and Equilibrium , 2010 .

[18]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[19]  H. Simon,et al.  A Behavioral Model of Rational Choice , 1955 .

[20]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[21]  Y. Mansour,et al.  On Nash Equilibria for a Network Creation Game , 2006, TEAC.

[22]  Christodoulos A. Floudas,et al.  Global optimization of mixed-integer bilevel programming problems , 2005, Comput. Manag. Sci..

[23]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[24]  Jonathan F. Bard,et al.  The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..

[25]  Frank Plastria,et al.  Discrete models for competitive location with foresight , 2008, Comput. Oper. Res..

[26]  V J Rayward-Smith.  Steiner Minimal Trees , 1998, J. Oper. Res. Soc..

[27]  Paul H. Calamai,et al.  Bilevel and multilevel programming: A bibliography review , 1994, J. Glob. Optim..

[28]  Berç Rustem,et al.  Parametric global optimisation for bilevel programming , 2007, J. Glob. Optim..

[29]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[30]  Carlos Eduardo Ferreira,et al.  Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem , 2007, Inf. Process. Lett..

[31]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[32]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[33]  Georgios Piliouras,et al.  A Delivery Network Creation Game , 2009 .

[34]  Tim Roughgarden,et al.  Designing networks with good equilibria , 2008, SODA '08.

[35]  Stephan Dempe,et al.  Discrete bilevel programming: Application to a natural gas cash-out problem , 2005, Eur. J. Oper. Res..

[36]  U. Brandes,et al.  Network Creation Games with Disconnected Equilibria , 2008, WINE.

[37]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[38]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[39]  S. R. Arora,et al.  An algorithm for the integer linear fractional bilevel programming problem , 1997 .

[40]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[41]  P. Marcotte,et al.  A bilevel model of taxation and its application to optimal highway pricing , 1996 .

[42]  Charles ReVelle,et al.  The Maximum Capture Problem with Uncertainty , 1996 .

[43]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[44]  Yishay Mansour,et al.  A Network Creation Game with Nonuniform Interests , 2007, WINE.

[45]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[46]  Lawrence V. Snyder,et al.  Facility location under uncertainty: a review , 2006 .

[47]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

[48]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[49]  Robert G. Jeroslow,et al.  The polynomial hierarchy and a simple model for competitive analysis , 1985, Math. Program..

[50]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[51]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[52]  Dominik Kress,et al.  Sequential competitive location on networks , 2013, Eur. J. Oper. Res..

[53]  P. Marcotte,et al.  A bilevel modelling approach to pricing and fare optimisation in the airline industry , 2003 .

[54]  Marianthi G. Ierapetritou,et al.  Resolution method for mixed integer bi-level linear problems based on decomposition technique , 2009, J. Glob. Optim..

[55]  Tim Roughgarden,et al.  The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.

[56]  Georgia Perakis,et al.  The Price of Anarchy in Supply Chains: Quantifying the Efficiency of Price-Only Contracts , 2007, Manag. Sci..

[57]  Arthur W. Westerberg,et al.  Bilevel programming for steady-state chemical process design—I. Fundamentals and algorithms , 1990 .

[58]  M. Jackson.  A Survey of Models of Network Formation: Stability and Efficiency , 2003 .

[59]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[60]  L. Snyder.  Introduction to Facility Location , 2011 .

[61]  Maw-Sheng Chern,et al.  Nonlinear integer bilevel programming , 1994 .

[62]  Gilbert Laporte,et al.  Sequential location problems , 1997 .

[63]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[64]  David E. Boyce,et al.  Construction of a real-world bilevel linear programming model of the highway network design problem , 1992, Ann. Oper. Res..

[65]  Andreas Drexl,et al.  Facility location models for distribution system design , 2005, Eur. J. Oper. Res..

[66]  Matteo Fischetti,et al.  Facets of two Steiner arborescence polyhedra , 1991, Math. Program..

[67]  R. Aumann,et al.  The Shapley value: Endogenous formation of links between players and of coalitions: an application of the Shapley value , 1988 .

[68]  Jonathan F. Bard.  Bilevel Programming in Management , 2009, Encyclopedia of Optimization.

[69]  Jonathan F. Bard,et al.  Coordination of a multidivisional organization through two levels of management , 1983 .

[70]  H. A. Eiselt.  Equilibria in Competitive Location Models , 2011 .

[71]  Peter Värbrand,et al.  A strong lower bound for the Node Weighted Steiner Tree Problem , 1998 .

[72]  Gilbert Laporte,et al.  Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..

[73]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[74]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[75]  A. Roth,et al.  The Job Market for New Economists: A Market Design Perspective , 2010 .

[76]  Ted K. Ralphs,et al.  A Branch-and-cut Algorithm for Integer Bilevel Linear Programs , 2009 .

[77]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[78]  Ue-Pyng Wen,et al.  Algorithms for solving the mixed integer two-level linear programming problem , 1990, Comput. Oper. Res..

[79]  Alexey I. Kushnir.  Harmful Signaling in Matching Markets , 2013 .

[80]  S. Hakimi.  On locating new facilities in a competitive environment , 1983 .

[81]  Benjamin F. Hobbs,et al.  A nonlinear bilevel model for analysis of electric utility demand-side planning issues , 1992, Ann. Oper. Res..

[82]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[83]  André de Palma,et al.  Discrete Choice Theory of Product Differentiation , 1995 .

[84]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[85]  S. Dempe.  Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints , 2003 .

[86]  Mahyar A. Amouzegar,et al.  Determining optimal pollution control policies: An application of bilevel programming , 1999, Eur. J. Oper. Res..

[87]  J. Bard,et al.  An algorithm for the discrete bilevel programming problem , 1992 .

[88]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[89]  Jerome Bracken,et al.  Mathematical Programs with Optimization Problems in the Constraints , 1973, Oper. Res..

[90]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[91]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[92]  Simon P. Anderson,et al.  Interpretations of the logit discrete choice models and the theory of product differentiation , 1992 .

[93]  Elias Koutsoupias,et al.  Coordination mechanisms , 2009, Theor. Comput. Sci..

[94]  Éva Tardos,et al.  Near-Optimal Network Design with Selfish Agents , 2008, Theory Comput..

[95]  R. Kevin Wood,et al.  Shortest‐path network interdiction , 2002, Networks.

[96]  Vedat Verter,et al.  Designing a Road Network for Hazardous Materials Transportation , 2004, Transp. Sci..

[97]  D. Serra,et al.  Market capture by two competitors: The pre-emptive location problem , 1994 .

[98]  Jonathan F. Bard,et al.  An algorithm for the mixed-integer nonlinear bilevel programming problem , 1992, Ann. Oper. Res..

[99]  A. Ciric,et al.  A dual temperature simulated annealing approach for solving bilevel programming problems , 1998 .

[100]  Alexander Mitsos,et al.  Global solution of nonlinear mixed-integer bilevel programs , 2010, J. Glob. Optim..