On the computational complexity of qualitative coalitional games

Artificial Intelligence

Volumn 158, Issue 1, 2004, Pages 27-73

  Wooldridge, Michael ^a   Dunne, Paul E ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Coalitional games; Computational complexity; Multiagent systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; GAME THEORY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; MULTI AGENT SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

COALITIONAL GAME; COOPERATIVE GAME THEORY; QUALITATIVE COALITIONAL GAMES (QCG);

ARTIFICIAL INTELLIGENCE;

EID: 3142697097     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.04.002     Document Type: Article

References (39)

1. Abdou J., Keiding H. Effectivity Functions in Social Choice Theory. 1991;Kluwer Academic, Dordrecht.
2. J. Bilbao, J. Fernández, J. López, Complexity in cooperative game theory, Manuscript.
3. Bond A.H., Gasser L. Readings in Distributed Artificial Intelligence. 1988;Morgan Kaufmann, San Mateo, CA.
4. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35:(6):1986;677-691.
5. Bryant R.E. Symbolic manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24:(3):1992;293-318.
6. Chang R., Kadin J. The boolean hierarchy and the polynomial hierarchy: a closer connection. SIAM J. Comput. 25:(2):1996;340-354.
7. Conitzer V., Sandholm T. Complexity of determining nonemptiness of the core. Proc. IJCAI-03, Acapulco, Mexico. 2003;613-618.
8. d'Inverno M., Luck M., Wooldridge M. Cooperation structures. Proc. IJCAI-97, Nagoya, Japan. 1997;600-605.
9. Dunne P.E. The Complexity of Boolean Networks. 1988;Academic Press, London.
10. Dunne P.E. Prevarication in dispute protocols. Proc. Ninth International Conference on AI and Law (ICAIL'03), Edinburgh. 2003;12-21 ACM Press, New York.
11. Fischer M., Pippenger N.J. Relations among complexity measures. J. ACM. 26:1979;361-381.
12. Gabbay D., Woods J. More on non-cooperation in dialogue logic. Logic J. IGPL. 9:2001;305-323.
13. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
14. Haddawy P., Hanks S. Utility models for goal-directed decision-theoretic planners. Comput. Intelligence. 14:(3):1998;392-429.
15. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2:1975;225-231.
16. Johnson D.S. A catalog of complexity classes. van Leeuwen J. Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity. 1990;67-161 Elsevier, Amsterdam.
17. Kadin J. The polynomial time hierarchy collapses if the boolean hierarchy collapses. SIAM J. Comput. 17:(6):1988;1263-1282.
18. Khrapchenko V.M. Methods of determining lower bounds for the complexity of Π -schemes. Math. Notes Acad. Sci. USSR. 10:1971;474-479.
19. Lupanov O.B. On a method of circuit synthesis. Izv. VUZ (Radiofizika). 1:1958;120-140.
20. Morris P. Introduction to Game Theory. 1994;Springer, Berlin.
21. Moses Y., Tennenholtz M. Multi-entity models. Furukawa K., Michie D., Muggleton S. Machine Intelligence 14, Tokyo, Japan. 1995;65-90.
22. Osborne M.J., Rubinstein A. A Course in Game Theory. 1994;MIT Press, Cambridge, MA.
23. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
24. Papadimitriou C.H., Yannakakis M. The complexity of facets (and some facets of complexity). Proc. Fourteenth ACM Symposium on the Theory of Computing (STOC-82), San Francisco, CA. 1982;255-260.
25. Parsons S. Qualitative Methods for Reasoning Under Uncertainty. 2001;MIT Press, Cambridge, MA.
26. Pauly M. A modal logic for coalitional power in games. J. Logic Comput. 12:(1):2002;149-166.
27. Pratt V.R. The effect of basis on the size of Boolean expressions. Proc. Sixteenth Symposium on Foundations of Computer Science (FOCS). 1975;119-121.
28. Razborov A.A. A lower bound on the monotone complexity of the logical permanent. Math. Notes Acad. Sci. USSR. 37:1985;485-493.
29. Sandholm T. Distributed rational decision making. Weiß G. Multiagent Systems. 1999;201-258 MIT Press, Cambridge, MA.
30. Sandholm T., Larson K., Andersson M., Shehory O., Tohmé F. Coalition structure generation with worst case guarantees. Artificial Intelligence. 111:(1-2):1999;209-238.
31. Schnorr C.P. The network complexity and Turing machine complexity of finite functions. Acta Inform. 7:1976;95-107.
32. Shehory O., Kraus S. Coalition formation among autonomous agents: Strategies and complexity. Castelfranchi C., Müller J.-P. From Reaction to Cognition - Fifth European Workshop on Modelling Autonomous Agents in a Multi-Agent World, MAAMAW-93. Lecture Notes in Artificial Intelligence. vol. 957:1995;56-72 Springer, Berlin.
33. Shehory O., Kraus S. Task allocation via coalition formation among autonomous agents. Proc. IJCAI-95, Montréal, Québec. 1995;655-661.
34. Shehory O., Kraus S. Methods for task allocation via agent coalition formation. Artificial Intelligence. 101:(1-2):1998;165-200.
35. Shehory O., Kraus S. Feasible formation of stable coalitions among autonomous agents in non-super-additive environments. Comput. Intelligence. 15:(33):1999;218-251.
36. Tennenholtz M., Moses Y. On cooperation in a multi-entity model: Preliminary report. Proc. IJCAI-89, Detroit, MI. 1989;918-923.
37. Wooldridge M. An Introduction to Multiagent Systems. 2002;Wiley, New York.
38. Wrathall C. Complete sets and the polynomial-time hierarchy. Theoret. Comput. Sci. 3:1976;23-33.
39. Zagare F.C. Game Theory: Concepts and Applications. 1984;Sage Publications, Beverly Hills.