Leadership in Singleton Congestion Games: What is Hard and What is Easy
暂无分享,去创建一个
Stefano Coniglio | Nicola Gatti | Alberto Marchesi | Matteo Castiglioni | N. Gatti | S. Coniglio | A. Marchesi | Matteo Castiglioni | Stefano Coniglio
[1] Stefano Coniglio,et al. Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case , 2018, ArXiv.
[2] Po-An Chen,et al. Generalized mirror descents in congestion games , 2016, Artif. Intell..
[3] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[4] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[5] Vincent Conitzer,et al. Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.
[6] I. K. Altinel,et al. A leader-follower game in competitive facility location , 2012, Comput. Oper. Res..
[7] Dincer Konur,et al. Competitive multi-facility location games with non-identical firms and convex traffic congestion costs , 2012 .
[8] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[9] Yevgeniy Vorobeychik,et al. Equilibrium Analysis of Multi-Defender Security Games , 2015, IJCAI.
[10] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.
[11] Martine Labbé. Bilevel Programming and Price Setting Problems , 2006, OR.
[12] Dimitris Fotakis,et al. Stackelberg Strategies for Atomic Congestion Games , 2007, Theory of Computing Systems.
[13] Akira Okada,et al. Inspector Leadership with Incomplete Information , 1991 .
[14] Vincent Conitzer,et al. Signaling in Bayesian Stackelberg Games , 2016, AAMAS.
[15] Nicola Gatti,et al. Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders (Extended Version) , 2019, IJCAI.
[16] Vittorio Bilò,et al. On Stackelberg Strategies in Affine Congestion Games , 2015, WINE.
[17] Tuomas Sandholm,et al. Trembling-Hand Perfection in Extensive-Form Games with Commitment , 2018, IJCAI.
[18] Gerhard J. Woeginger,et al. Bilevel Knapsack with Interdiction Constraints , 2016, INFORMS J. Comput..
[19] Tuomas Sandholm,et al. Quasi-Perfect Stackelberg Equilibrium , 2018, AAAI.
[20] Stefano Coniglio,et al. Pessimistic Leader-Follower Equilibria with Multiple Followers , 2017, IJCAI.
[21] Nicola Gatti,et al. Computing the Strategy to Commit to in Polymatrix Games , 2018, AAAI.
[22] Stefano Coniglio,et al. Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria , 2017, SEA.
[23] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[24] Vincent Conitzer,et al. Computing optimal strategies to commit to in extensive-form games , 2010, EC '10.
[25] Yevgeniy Vorobeychik,et al. MultiDefender security games on networks , 2014, PERV.
[26] Stefano Coniglio,et al. Leadership in Singleton Congestion Games , 2018, IJCAI.
[27] Edoardo Amaldi,et al. Network Optimization Problems Subject to Max-Min Fair Flow Allocation , 2013, IEEE Communications Letters.
[28] Hanif D. Sherali,et al. A Multiple Leader Stackelberg Model and Analysis , 1984, Oper. Res..
[29] Dimitris Fotakis,et al. A Selective Tour Through Congestion Games , 2015, Algorithms, Probability, Networks, and Games.
[30] Sven Leyffer,et al. Solving multi-leader–common-follower games , 2010, Optim. Methods Softw..
[31] Yevgeniy Vorobeychik,et al. Multidefender Security Games , 2015, IEEE Intelligent Systems.
[32] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[33] Bethany L. Nicholson,et al. Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.
[34] Stefano Coniglio,et al. Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games , 2020, EURO J. Comput. Optim..
[35] Stefano Coniglio,et al. Methods for Finding Leader-Follower Equilibria with Multiple Followers: (Extended Abstract) , 2016, AAMAS.
[36] Tim Roughgarden,et al. Stackelberg scheduling strategies , 2001, STOC '01.
[37] Nicola Gatti,et al. Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version) , 2019, IJCAI.
[38] H. Stackelberg,et al. Marktform und Gleichgewicht , 1935 .
[39] Bo An,et al. GUARDS and PROTECT: next generation applications of security games , 2011, SECO.
[40] Branislav Bosanský,et al. Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games , 2015, AAAI.
[41] Ankur A. Kulkarni,et al. A Shared-Constraint Approach to Multi-Leader Multi-Follower Games , 2012, 1206.2968.
[42] Michael Wooldridge,et al. Stackelberg Security Games with Multiple Uncoordinated Defenders , 2018, AAMAS.
[43] L. Shapley,et al. Potential Games , 1994 .
[44] William H. Sandholm,et al. Evolutionary Implementation and Congestion Pricing , 2002 .
[45] Tuomas Sandholm,et al. Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead , 2017, AAAI.
[46] Branislav Bosanský,et al. Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games , 2016, AAAI.
[47] Bernhard von Stengel,et al. Leadership games with convex strategy sets , 2010, Games Econ. Behav..
[48] Huifu Xu,et al. A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application , 2009, Oper. Res..
[49] Vincent Conitzer,et al. Commitment to Correlated Strategies , 2011, AAAI.
[50] Yoav Shoham,et al. Fast and Compact: A Simple Class of Congestion Games , 2005, AAAI.
[51] P. Marcotte,et al. A bilevel model of taxation and its application to optimal highway pricing , 1996 .
[52] Vincent Conitzer,et al. Computing Optimal Strategies to Commit to in Stochastic Games , 2012, AAAI.
[53] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[54] Vincenzo Bonifaci,et al. Stackelberg Routing in Arbitrary Networks , 2008, Math. Oper. Res..
[55] Renato F. Werneck,et al. Finding minimum congestion spanning trees , 1999, JEAL.
[56] Csaba D. Tóth,et al. Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.
[57] A. Haurie,et al. Sequential Stackelberg equilibria in two-person games , 1985 .
[58] Masao Fukushima,et al. Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games , 2009, Comput. Manag. Sci..
[59] Yevgeniy Vorobeychik,et al. Multi-Defender Strategic Filtering Against Spear-Phishing Attacks , 2016, AAAI.
[60] Martin Skutella,et al. Protection of flows under targeted attacks , 2017, Oper. Res. Lett..
[61] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[62] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[63] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.
[64] Yevgeniy Vorobeychik,et al. Computing Stackelberg Equilibria in Discounted Stochastic Games , 2012, AAAI.
[65] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[66] Vincent Conitzer,et al. Learning and Approximating the Optimal Strategy to Commit To , 2009, SAGT.