Game-Theoretically Allocating Resources to Catch Evaders and Payments to Stabilize Teams

Game-Theoretically Allocating Resources to Catch Evaders and Payments to Stabilize Teams

[1]  Vincent Conitzer,et al.  Security scheduling for real-world networks , 2013, AAMAS.

[2]  Sarit Kraus,et al.  Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.

[3]  Vincent Conitzer,et al.  Game-Theoretic Question Selection for Tests , 2013, IJCAI.

[4]  Eitan Zemel,et al.  Nash and correlated equilibria: Some complexity considerations , 1989 .

[5]  E. Kohlberg.  On the Nucleolus of a Characteristic Function Game , 1971 .

[6]  Vincent Conitzer,et al.  A Maximum Likelihood Approach towards Aggregating Partial Orders , 2011, IJCAI.

[7]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

[8]  Abraham Charnes,et al.  Coalitional and Chance-Constrained Solutions to n-Person Games, II: Two-Stage Solutions , 1977, Oper. Res..

[9]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[10]  Gooni Orshan,et al.  The prenucleolus and the reduced game property: Equal treatment replaces anonymity , 1993 .

[11]  Vincent Conitzer,et al.  Common Voting Rules as Maximum Likelihood Estimators , 2005, UAI.

[12]  Steve Cooper,et al.  Reflections on Stanford's MOOCs , 2013, CACM.

[13]  Jeffrey S. Rosenschein,et al.  Coalitional skill games , 2008, AAMAS.

[14]  Alain Chateauneuf,et al.  Some Characterizations of Lower Probabilities and Other Monotone Capacities through the use of Möbius Inversion , 1989, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[15]  Craig Boutilier,et al.  Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept , 2007, AAMAS '07.

[16]  Bezalel Peleg,et al.  An axiomatization of the core of cooperative games without side payments , 1985 .

[17]  Milind Tambe,et al.  Protecting Moving Targets with Multiple Mobile Resources , 2013, J. Artif. Intell. Res..

[18]  L. S. Shapley,et al.  Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts , 1979, Math. Oper. Res..

[19]  Moshe Tennenholtz,et al.  Solving Cooperative Reliability Games , 2011, UAI.

[20]  Toshihide Ibaraki,et al.  Algorithmic Aspects of the Core of Combinatorial Optimization Games , 1999, Math. Oper. Res..

[21]  Vincent Conitzer,et al.  Solving Security Games on Graphs via Marginal Probabilities , 2013, AAAI.

[22]  Milind Tambe,et al.  Security and Game Theory: IRIS – A Tool for Strategic Security Allocation in Transportation Networks , 2011, AAMAS 2011.

[23]  Vincent Conitzer,et al.  Security Games with Multiple Attacker Resources , 2011, IJCAI.

[24]  Chris Snijders,et al.  Axiomatization of the Nucleolus , 1995, Math. Oper. Res..

[25]  Jeroen Kuipers,et al.  On the computation of the nucleolus of a cooperative game , 2001, Int. J. Game Theory.

[26]  Michel Truchon,et al.  Maximum likelihood approach to vote aggregation with variable probabilities , 2004, Soc. Choice Welf..

[27]  Hannu Nurmi,et al.  Closeness Counts in Social Choice , 2008 .

[28]  Lloyd S. Shapley,et al.  On balanced sets and cores , 1967 .

[29]  Vincent Conitzer,et al.  Complexity Results about Nash Equilibria , 2002, IJCAI.

[30]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[31]  Sven Koenig,et al.  Algorithms and Complexity Results for Pursuit-Evasion Problems , 2009, IJCAI.

[32]  Manish Jain,et al.  Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up , 2011, AAMAS.

[33]  Sarit Kraus,et al.  Bayesian stackelberg games and their application for security at Los Angeles international airport , 2008, SECO.

[34]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[35]  Jeffrey S. Rosenschein,et al.  Subsidies, Stability, and Restricted Cooperation in Coalitional Games , 2011, IJCAI.

[36]  Bo An,et al.  PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.

[37]  Vincent Conitzer,et al.  Learning and Approximating the Optimal Strategy to Commit To , 2009, SAGT.

[38]  Yoav Shoham,et al.  Marginal contribution nets: a compact representation scheme for coalitional games , 2005, EC '05.

[39]  Michael Wooldridge,et al.  A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications , 2008, Math. Log. Q..

[40]  R. Aumann.  Subjectivity and Correlation in Randomized Strategies , 1974 .

[41]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[42]  Piotr Faliszewski,et al.  On distance rationalizability of some voting rules , 2009, TARK '09.

[43]  Vincent Conitzer,et al.  On Stackelberg mixed strategies , 2015, Synthese.

[44]  C. Han.  A fast algorithm for the minimax flow problem with 01 weights , 1997 .

[45]  Roger B. Myerson,et al.  Virtual utility and the core for games with incomplete information , 2004, J. Econ. Theory.

[46]  Sarit Kraus,et al.  Using Game Theory for Los Angeles Airport Security , 2009, AI Mag..

[47]  Craig Boutilier,et al.  Coalitional Bargaining with Agent Type Uncertainty , 2007, IJCAI.

[48]  Craig Boutilier,et al.  Bayesian reinforcement learning for coalition formation under uncertainty , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[49]  Luigi Palopoli,et al.  Infeasibility Certificates and the Complexity of the Core in Coalitional Games , 2007, IJCAI.

[50]  Vincent Conitzer,et al.  Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.

[51]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[52]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[53]  Marcus Pivato,et al.  Voting rules as statistical estimators , 2013, Soc. Choice Welf..

[54]  Vincent Conitzer,et al.  Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains , 2014, AAAI.

[55]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[56]  Edmund H. Durfee,et al.  Coherent Cooperation Among Communicating Problem Solvers , 1987, IEEE Transactions on Computers.

[57]  L. Shapley,et al.  QUASI-CORES IN A MONETARY ECONOMY WITH NONCONVEX PREFERENCES , 1966 .

[58]  Justin Reich,et al.  Rebooting MOOC Research , 2015, Science.

[59]  H. Young.  Condorcet's Theory of Voting , 1988, American Political Science Review.

[60]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[61]  P. Borm,et al.  Stochastic Cooperative Games: Superadditivity, Convexity, and Certainty Equivalents , 1999 .

[62]  Yoav Shoham,et al.  Bayesian Coalitional Games , 2008, AAAI.

[63]  Eitan Zemel,et al.  Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..

[64]  Michael Wooldridge,et al.  Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.

[65]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[66]  Yann Chevaleyre,et al.  Representing Utility Functions via Weighted Goals , 2009, Math. Log. Q..

[67]  Vincent Conitzer,et al.  New complexity results about Nash equilibria , 2008, Games Econ. Behav..

[68]  Luigi Palopoli,et al.  On the complexity of core, kernel, and bargaining set , 2008, Artif. Intell..

[69]  Robert P. Gilles.  The Cooperative Game Theory of Networks and Hierarchies , 2010 .

[70]  Manish Jain,et al.  Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.

[71]  Anja De Waegenaere,et al.  Cooperative games with stochastic payoffs , 1999, Eur. J. Oper. Res..

[72]  Vincent Conitzer,et al.  Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness , 2011, J. Artif. Intell. Res..

[73]  K. Hew,et al.  Students’ and instructors’ use of massive open online courses (MOOCs): Motivations and challenges , 2014 .

[74]  Michael Wooldridge.  Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.

[75]  Bernhard von Stengel,et al.  Leadership games with convex strategy sets , 2010, Games Econ. Behav..

[76]  Alex Gershkov,et al.  Optimal Voting Rules , 2013 .

[77]  Vincent Conitzer,et al.  Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains , 2004, AAAI.

[78]  Luigi Palopoli,et al.  On the Complexity of the Core over Coalition Structures , 2011, IJCAI.

[79]  Juan Camilo Gómez,et al.  Core extensions for non-balanced TU-games , 2008, Int. J. Game Theory.

[80]  Vincent Conitzer,et al.  Computing the optimal strategy to commit to , 2006, EC '06.

[81]  Milind Tambe,et al.  TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems , 2012, IAAI.

[82]  Bo An,et al.  PROTECT - A Deployed Game Theoretic System for Strategic Security Allocation for the United States Coast Guard , 2012, AI Mag..

[83]  Vincent Conitzer,et al.  Complexity of constructing solutions in the core based on synergies among coalitions , 2006, Artif. Intell..

[84]  Peter Sudhölter,et al.  The modified nucleolus: Properties and axiomatizations , 1997, Int. J. Game Theory.

[85]  Abraham Charnes,et al.  Coalitional and Chance-Constrained Solutions to N-Person Games. I. The Prior Satisficing Nucleolus. , 1976 .