Methods for Finding Leader-Follower Equilibria with Multiple Followers: (Extended Abstract)
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Commitment to Correlated Strategies , 2011, AAAI.
[2] Alberto Costa,et al. Black-Box Optimization of Lighting Simulation in Architectural Design , 2014, CSDM Asia.
[3] Patrice Marcotte,et al. Bilevel programming: A survey , 2005, 4OR.
[4] Yoav Shoham,et al. Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..
[5] Michael A. Saunders,et al. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..
[6] Vincent Conitzer,et al. New complexity results about Nash equilibria , 2008, Games Econ. Behav..
[7] Stephan Dempe,et al. Foundations of Bilevel Programming , 2002 .
[8] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[9] Bernhard von Stengel,et al. Leadership games with convex strategy sets , 2010, Games Econ. Behav..
[10] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[11] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.
[12] Yoav Shoham,et al. Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[13] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[14] Bo An,et al. GUARDS and PROTECT: next generation applications of security games , 2011, SECO.
[15] Vincent Conitzer,et al. Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.