Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The complexity of Boolean networks
The complexity of Boolean networks
Distributed Artificial Intelligence
Distributed Artificial Intelligence
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
Methods for task allocation via agent coalition formation
Artificial Intelligence
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
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Temporal qualitative coalitional games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Complexity of task coordination for non cooperative planning agents
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Verifying time, memory and communication bounds in systems of reasoning agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Reasoning about coalitional games
Artificial Intelligence
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Resource constraints on computation and communication in the brain
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A logic for coalitions with bounded resources
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the (Un-)Decidability of Model Checking Resource-Bounded Agents
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
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.