Sequential Interdiction with Incomplete Information and Learning

References

• Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.Link, Google Scholar
• Audet C, Hansen P, Jaumard B, Savard G (1997) Links between linear bilevel and mixed 0–1 programming problems. J. Optim. Theory Appl. 93(2):273–300.Crossref, Google Scholar
• Audibert J-Y, Bubeck S (2009) Minimax policies for adversarial and stochastic bandits. Dasgupta S, Klivans A, eds. Proc. 21st Annual Conf. Learn. Theory (COLT) (Omnipress, Montreal), 217–226.Google Scholar
• Audibert J-Y, Bubeck S, Lugosi G (2013) Regret in online combinatorial optimization. Math. Oper. Res. 39(1):31–45.Link, Google Scholar
• Auer P, Cesa-Bianchi N, Freund Y, Schapire RE (2002) The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1):48–77.Crossref, Google Scholar
• Bard JF, Plummer J, Sourie JC (2000) A bilevel programming approach to determining tax credits for biofuel production. Eur. J. Oper. Res. 120(1):30–46.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
• Borrero JS (2017) Sequential bilevel linear programming with incomplete information and learning. Unpublished doctoral dissertation, University of Pittsburgh, Pittsburgh.Google Scholar
• Borrero JS, Prokopyev OA, Sauré D (2016) Sequential shortest path interdiction with incomplete information. Decision Anal. 13(1):68–98.Link, Google Scholar
• Brown G, Carlyle M, Salmerón J, Wood K (2006) Defending critical infrastructure. Interfaces 36(6):530–544.Link, Google Scholar
• Brown G, Carlyle M, Diehl D, Kline J, Wood K (2005) A two-sided optimization for theater ballistic missile defense. Oper. Res. 53(5):745–763.Link, Google Scholar
• Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. CoRR abs/1204.5721. Accessed May 2015, http://arxiv.org/abs/1204.5721.Google Scholar
• Caprara A, Carvalho M, Lodi A, Woeginger GJ (2013) A complexity and approximability study of the bilevel knapsack problem. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 7801 (Springer, Berlin, Heidelberg), 98–109.Crossref, Google Scholar
• Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games (Cambridge University Press, New York).Crossref, Google Scholar
• Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann. Oper. Res. 153(1):235–256.Crossref, Google Scholar
• Côté J-P, Marcotte P, Savard G (2003) A bilevel modelling approach to pricing and fare optimisation in the airline industry. J. Revenue Pricing Management 2(1):23–36.Crossref, Google Scholar
• DeNegre S (2011) Interdiction and discrete bilevel linear programming. Unpublished doctoral dissertation, Lehigh University, Bethlehem, PA.Google Scholar
• Hazan E (2015) Introduction to online convex optimization (draft). Foundations and Trends in Optimization (Now Publishers Inc., Hanover, MA). Available at http://ocobook.cs.princeton.edu/OCObook.pdf.Google Scholar
• Held H, Hemmecke R, Woodruff D (2005) A decomposition algorithm applied to planning the interdiction of stochastic networks. Naval Res. Logist. 52(4):321–328.Crossref, Google Scholar
• Israeli E, Wood R (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Lucotte M, Nguyen S (2013) Equilibrium and Advanced Transportation Modelling (Springer Science & Business Media, Boston).Google Scholar
• Morton D, Pan F, Saeger K (2007) Models for nuclear smuggling interdiction. IIE Trans. 39(1):3–14.Crossref, Google Scholar
• Salmeron J, Wood K, Baldick R (2004) Analysis of electric grid security under terrorist threat. IEEE Trans. Power Systems 19(2):905–912.Crossref, Google Scholar
• Sherali HD, Soyster AL, Murphy FH (1983) Stackelberg-Nash-Cournot equilibria: Characterizations and computations. Oper. Res. 31(2):253–276.Link, Google Scholar
• Smith JC, Lim C (2008) Algorithms for network interdiction and fortification games. Chinchuluun A, Pardalos PM, Migdalas A, Pitsoulis L, eds. Pareto Optimality, Game Theory and Equilibria (Springer-Verlag, New York), 609–644.Crossref, Google Scholar
• Wolsey LA, Nemhauser GL (2014) Integer and Combinatorial Optimization (John Wiley & Sons, New York).Google Scholar
• Wood RK (1993) Deterministic network interdiction. Math. Comput. Model. 17(2):1–18.Crossref, Google Scholar
• Wood RK (2011) Bilevel network interdiction models: Formulations and solutions. Cochran JJ, Cox LA Jr, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Zare MH, Borrero JS, Prokopyev OA, Zeng B (2019) A note on linearized reformulations for a class of bilevel linear integer problems. Ann. Oper. Res. 272(1-2):99–117.Crossref, Google Scholar
• Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. Fawcett T, Mishra N, eds. Proc. 20th Internat. Conf. Machine Learn. (AAAI Press, Palo Alto, CA), 928–936.Google Scholar