Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The complexity of Boolean networks
The complexity of Boolean networks
Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
On the complexity of cooperative solution concepts
Mathematics of Operations Research
Coalitions among computationally bounded agents
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Distributed problem solving and planning
Multiagent systems
Distributed rational decision making
Multiagent systems
Coalition structure generation with worst case guarantees
Artificial Intelligence
Strategic negotiation in multiagent environments
Strategic negotiation in multiagent environments
Coordinating Plans of Autonomous Agents
Coordinating Plans of Autonomous Agents
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Coalition Formation among Rational Agents
IEEE Intelligent Systems
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
On the computational complexity of qualitative coalitional games
Artificial Intelligence
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Temporal qualitative coalitional games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The Parallel Evaluation of Arithmetic Expressions Without Division
IEEE Transactions on Computers
The effect of basis on size of Boolean expressions
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
On cooperation in a multi-entity model
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Task allocation via coalition formation among autonomous agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Coalition formation among bounded rational agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Complexity of determining nonemptiness of the core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Methods for task allocation via agent coalition formation
Artificial Intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Verifying Time and Communication Costs of Rule-Based Reasoners
Model Checking and Artificial Intelligence
Solving coalitional resource games
Artificial Intelligence
An anytime coalition restructuring algorithm in an open environment
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Searching for agent coalition using particle swarm optimization and death penalty function
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Coalition structure generation utilizing compact characteristic function representations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Expressing properties of coalitional ability under resource bounds
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
A logic-based representation for coalitional games with externalities
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Resource-bounded alternating-time temporal logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On agent types in coalition formation problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proof systems and transformation games
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Non-transferable utility coalitional games via mixed-integer linear constraints
Journal of Artificial Intelligence Research
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Concise characteristic function representations in coalitional games based on agent types
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Proof systems and transformation games
Annals of Mathematics and Artificial Intelligence
Efficient computation of the shapley value for game-theoretic network centrality
Journal of Artificial Intelligence Research
Computing cooperative solution concepts in coalitional skill games
Artificial Intelligence
Coalitional games via network flows
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fostering Cooperation through Dynamic Coalition Formation and Partner Switching
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.00 |
We study Coalitional Resource Games (crgs), a variation of Qualitative Coalitional Games (qcgs) in which each agent is endowed with a set of resources, and the ability of a coalition to bring about a set of goals depends on whether they are collectively endowed with the necessary resources. We investigate and classify the computational complexity of a number of natural decision problems for crgs, over and above those previously investigated for qcgs in general. For example, we show that the complexity of determining whether conflict is inevitable between two coalitions with respect to some stated resource bound (i.e., a limit value for every resource) is co-np-complete. We then investigate the relationship between crgs and qcgs, and in particular the extent to which it is possible to translate between the two models. We first characterise the complexity of determining equivalence between crgs and qcgs. We then show that it is always possible to translate any given crg into a succinct equivalent qcg, and that it is not always possible to translate a qcg into an equivalent crg; we establish some necessary and some sufficient conditions for a translation from qcgs to crgs to be possible, and show that even where an equivalent crg exists, it may have size exponential in the number of goals and agents of its source qcg.