Computing cooperative solution concepts in coalitional skill games

[1]  Jeffrey S. Rosenschein,et al.  Coalition, Cryptography, and Stability: Mechanisms for Coalition Formation in Task Oriented Domains , 2018, AAAI.

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

[3]  Yoram Bachrach,et al.  The Least-Core of Threshold Network Flow Games , 2011, MFCS.

[4]  Kyomin Jung,et al.  Coalitional Structure Generation in Skill Games , 2010, AAAI.

[5]  T. Roughgarden.  Algorithmic game theory , 2010, Commun. ACM.

[6]  Felix Brandt,et al.  Monotone cooperative games and their threshold versions , 2010, AAMAS.

[7]  Jeffrey S. Rosenschein,et al.  The Cost of Stability in Network Flow Games , 2009, MFCS.

[8]  Rahul Savani,et al.  Spanning connectivity games , 2009, ArXiv.

[9]  Mike Paterson,et al.  False name manipulations in weighted voting games: splitting, merging and annexation , 2009, AAMAS.

[10]  Jörg Rothe,et al.  The cost of stability in weighted voting games , 2009, AAMAS.

[11]  Jeffrey S. Rosenschein,et al.  Power in threshold network flow games , 2009, Autonomous Agents and Multi-Agent Systems.

[12]  Edith Elkind,et al.  Computing the nucleolus of weighted voting games , 2008, SODA.

[13]  Michael Wooldridge,et al.  On the Dimensionality of Voting Games , 2008, AAAI.

[14]  Sarit Kraus,et al.  Cooperative Boolean games , 2008, AAMAS.

[15]  Edith Elkind,et al.  Divide and conquer: false-name manipulations in weighted voting games , 2008, AAMAS.

[16]  Evangelos Markakis,et al.  Approximating power indices , 2008, AAMAS.

[17]  Ely Porat,et al.  Power and stability in connectivity games , 2008, AAMAS.

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

[19]  Piotr Faliszewski,et al.  The complexity of power-index comparison , 2008, Theor. Comput. Sci..

[20]  Michael Wooldridge,et al.  Computational Complexity of Weighted Threshold Games , 2007, AAAI.

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

[22]  Rolf Niedermeier,et al.  Exact algorithms and applications for Tree-like Weighted Set Cover , 2006, J. Discrete Algorithms.

[23]  Nicholas R. Jennings,et al.  Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks , 2006, AAAI.

[24]  Michael Wooldridge,et al.  On the computational complexity of coalitional resource games , 2006, Artif. Intell..

[25]  Yoav Shoham,et al.  Multi-attribute coalitional games , 2006, EC '06.

[26]  Yann Chevaleyre,et al.  Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling , 2006, KR.

[27]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[28]  Vincent Conitzer,et al.  Coalitional Games in Open Anonymous Environments , 2005, IJCAI.

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

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

[31]  Jérôme Lang,et al.  Expressive Power and Succinctness of Propositional Languages for Preference Representation , 2004, KR.

[32]  Nicholas R. Jennings,et al.  Computational-Mechanism Design: A Call to Arms , 2003, IEEE Intell. Syst..

[33]  Milind Tambe,et al.  A prototype infrastructure for distributed robot-agent-person teams , 2003, AAMAS '03.

[34]  C. V. Goldman,et al.  Self-organization through bottom-up coalition formation , 2003, AAMAS '03.

[35]  T. Sandholm,et al.  Complexity of determining nonemptiness of the core , 2003, ACM Conference on Economics and Computation.

[36]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[37]  Vincent Conitzer,et al.  Complexity of manipulating elections with few candidates , 2002, AAAI/IAAI.

[38]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[39]  Tomomi Matsui,et al.  NP-completeness for calculating power indices of weighted majority games , 2001, Theor. Comput. Sci..

[40]  Cees Witteveen,et al.  Boolean games , 2001 .

[41]  J. M. Bilbao,et al.  Cooperative Games on Combinatorial Structures , 2000 .

[42]  Hiroaki Kitano,et al.  RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[43]  U. Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[44]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[45]  Michael Wooldridge,et al.  Distributed Problem-Solving as Concurrent Theorem Proving , 1997, MAAMAW.

[46]  Francesco M. Donini,et al.  Comparing Space Efficiency of Propositional Knowledge Representation Formalisms , 1996, KR.

[47]  Jörg Denzinger,et al.  Planning for Distributed Theorem Proving: The Teamwork Approach , 1996, KI.

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

[49]  A. Zoltners,et al.  Structuring a Multiproduct Sales Quota-Bonus Plan for a Heterogeneous Sales Force: A Practical Model-Based Approach , 1994 .

[50]  E. Rasmusen.  Lobbying when the decisionmaker can acquire independent information , 1993 .

[51]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[52]  J. Chowdhury.  The motivational impact of sales quotas on effort. , 1993 .

[53]  L. Shapley.  A Value for n-person Games , 1988 .

[54]  A. Schrijver.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[55]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[56]  Jeffrey S. Rosenschein,et al.  Deals Among Rational Agents , 1985, IJCAI.

[57]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[58]  Guillermo Owen,et al.  On the core of linear production games , 1975, Math. Program..

[59]  G. Owen.  Multilinear extensions and the banzhaf value , 1975 .

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

[61]  Martin Shubik,et al.  A Method for Evaluating the Distribution of Power in a Committee System , 1954, American Political Science Review.

[62]  Walfredo Cirne,et al.  Job Scheduling Strategies for Parallel Processing , 2013, Lecture Notes in Computer Science.

[63]  International Foundation for Autonomous Agents and MultiAgent Systems ( IFAAMAS ) , 2007 .

[64]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[65]  Marco Schaerf,et al.  Arbitration (or How to Merge Knowledge Bases) , 1998, IEEE Trans. Knowl. Data Eng..

[66]  Michael R. Baye,et al.  Rigging the Lobbying Process: An Application of the All-Pay Auction , 1993 .

[67]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[68]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

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

[70]  Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Manipulating the Quota in Weighted Voting Games , 2022 .