Committing to correlated strategies with multiple leaders
暂无分享,去创建一个
[1] M. Blonski. Characterization of pure strategy equilibria in finite anonymous games , 2000 .
[2] Tuomas Sandholm,et al. Quasi-Perfect Stackelberg Equilibrium , 2018, AAAI.
[3] J. Nash. Two-Person Cooperative Games , 1953 .
[4] Stefano Coniglio,et al. Pessimistic Leader-Follower Equilibria with Multiple Followers , 2017, IJCAI.
[5] H. Stackelberg,et al. Marktform und Gleichgewicht , 1935 .
[6] Ken Binmore,et al. Noncooperative models of bargaining , 1992 .
[7] Kevin Leyton-Brown,et al. Polynomial-time computation of exact correlated equilibrium in compact games , 2015, Games Econ. Behav..
[8] Tuomas Sandholm,et al. Ex ante coordination and collusion in zero-sum multi-player extensive-form games , 2018, NeurIPS.
[9] Yevgeniy Vorobeychik,et al. MultiDefender security games on networks , 2014, PERV.
[10] E. Kalai,et al. OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .
[11] Vincent Conitzer,et al. Commitment to Correlated Strategies , 2011, AAAI.
[12] Bernhard von Stengel,et al. Leadership games with convex strategy sets , 2010, Games Econ. Behav..
[13] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[14] Edith Elkind,et al. Mechanism Design for Defense Coordination in Security Games , 2020, AAMAS.
[15] Nicola Gatti,et al. Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud , 2020, AAAI.
[16] Tim Roughgarden,et al. Simple versus Optimal Contracts , 2018, EC.
[17] B. Curtis Eaves,et al. Polymatrix Games with Joint Constraints , 1973 .
[18] Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS 2008.
[19] Kevin Leyton-Brown,et al. A General Framework for Computing Optimal Correlated Equilibria in Compact Games - (Extended Abstract) , 2011, WINE.
[20] Hanif D. Sherali,et al. A Multiple Leader Stackelberg Model and Analysis , 1984, Oper. Res..
[21] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[22] W. Thomson. Chapter 35 Cooperative models of bargaining , 1994 .
[23] Sarit Kraus,et al. Coalition Formation in Multi-defender Security Games , 2021, AAAI.
[24] Bernhard von Stengel,et al. Extensive-Form Correlated Equilibrium: Definition and Computational Complexity , 2008, Math. Oper. Res..
[25] Yuval Heller,et al. All-Stage Strong Correlated Equilibrium , 2008, Games Econ. Behav..
[26] Tuomas Sandholm,et al. Trembling-Hand Perfection in Extensive-Form Games with Commitment , 2018, IJCAI.
[27] Branislav Bosanský,et al. Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games , 2016, AAAI.
[28] Nicola Basilico,et al. Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms , 2016, AAAI.
[29] I. Ray. Coalition-proof correlated equilibrium: a definition , 1996 .
[30] R. Aumann. Subjectivity and Correlation in Randomized Strategies , 1974 .
[31] Nicola Gatti,et al. Computing the Strategy to Commit to in Polymatrix Games , 2018, AAAI.
[32] Nicola Gatti,et al. Bargaining over multiple issues in finite horizon alternating-offers protocol , 2006, Annals of Mathematics and Artificial Intelligence.
[33] Bo An,et al. GUARDS and PROTECT: next generation applications of security games , 2011, SECO.
[34] J. Sutton. Non-Cooperative Bargaining Theory: An Introduction , 1986 .
[35] Huifu Xu,et al. A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application , 2009, Oper. Res..
[36] Stefano Coniglio,et al. Leadership in Singleton Congestion Games: What is Hard and What is Easy , 2018, Artif. Intell..
[37] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[38] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[39] Kalyanmoy Deb,et al. Finding optimal strategies in a multi-period multi-leader-follower Stackelberg game using an evolutionary algorithm , 2013, Comput. Oper. Res..
[40] Sanford J. Grossman,et al. AN ANALYSIS OF THE PRINCIPAL-AGENT PROBLEM , 1983 .
[41] Nicholas R. Jennings,et al. An agenda-based framework for multi-issue negotiation , 2004, Artif. Intell..
[42] Bethany L. Nicholson,et al. Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.
[43] Stefano Coniglio,et al. Leadership in Singleton Congestion Games , 2018, IJCAI.
[44] Simon P. Anderson,et al. Incumbency effects in political campaigns , 1992 .
[45] Nicola Gatti,et al. Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version) , 2019, IJCAI.
[46] Michael Wooldridge,et al. Stackelberg Security Games with Multiple Uncoordinated Defenders , 2018, AAMAS.
[47] Sven Leyffer,et al. Solving multi-leader–common-follower games , 2010, Optim. Methods Softw..
[48] Nicholas Ziros. Negotiation-proof correlated equilibrium , 2011 .
[49] Branislav Bosanský,et al. Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games , 2015, AAAI.
[50] Noam Brown,et al. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals , 2018, Science.
[51] Boaz Barak,et al. Computational Complexity: ADVANCED TOPICS , 2009 .
[52] H. Winkler,et al. US and international climate policy under President Trump , 2018, Climate Policy.
[53] Kevin Waugh,et al. DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker , 2017, ArXiv.
[54] P. Jehiel,et al. On the Role of Outside Options in Bargaining with Obstinate Parties , 2002 .
[55] Stefano Coniglio,et al. Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case , 2019, Algorithmica.
[56] Nicola Gatti,et al. Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders (Extended Version) , 2019, IJCAI.
[57] Bo An,et al. Bilateral bargaining with one-sided uncertain reserve prices , 2013, Autonomous Agents and Multi-Agent Systems.
[58] Yevgeniy Vorobeychik,et al. Multidefender Security Games , 2015, IEEE Intelligent Systems.
[59] Nicola Gatti,et al. Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm , 2008, Artif. Intell..
[60] Yevgeniy Vorobeychik,et al. Equilibrium Analysis of Multi-Defender Security Games , 2015, IJCAI.
[61] Nicola Basilico,et al. Asynchronous Multi-Robot Patrolling against Intrusions in Arbitrary Topologies , 2010, AAAI.
[62] Nicola Gatti,et al. Extending the alternating-offers protocol in the presence of competition: models and theoretical analysis , 2009, Annals of Mathematics and Artificial Intelligence.
[63] Kevin Waugh,et al. DeepStack: Expert-level artificial intelligence in heads-up no-limit poker , 2017, Science.
[64] Nicola Gatti,et al. Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry , 2020, AAAI.
[65] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[66] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[67] Tim Roughgarden,et al. Algorithmic game theory , 2010, Commun. ACM.
[68] Yevgeniy Vorobeychik,et al. Multi-Defender Strategic Filtering Against Spear-Phishing Attacks , 2016, AAAI.
[69] Effrosyni Diamantoudi. Stable cartels revisited , 2001 .
[70] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[71] Emir Kamenica,et al. Bayesian Persuasion and Information Design , 2019, Annual Review of Economics.
[72] J. Vial,et al. Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon , 1978 .
[73] Milind Tambe,et al. When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing , 2015, IJCAI.
[74] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.
[75] Ankur A. Kulkarni,et al. A Shared-Constraint Approach to Multi-Leader Multi-Follower Games , 2012, 1206.2968.
[76] A. Haurie,et al. Sequential Stackelberg equilibria in two-person games , 1985 .
[77] A. Rubinstein. Perfect Equilibrium in a Bargaining Model , 1982 .
[78] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[79] Bo An,et al. PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.
[80] Masao Fukushima,et al. Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games , 2009, Comput. Manag. Sci..
[81] Vincent Conitzer,et al. On the value of commitment , 2013, Autonomous Agents and Multi-Agent Systems.
[82] Noam Brown,et al. Superhuman AI for multiplayer poker , 2019, Science.
[83] A. Rubinstein,et al. Bargaining and Markets , 1991 .