Tree clustering for constraint networks (research note)
Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
The interdisciplinary study of coordination
ACM Computing Surveys (CSUR)
On social laws for artificial agent societies: off-line design
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
Choosing social laws for multi-agent systems: minimality and simplicity
Artificial Intelligence
A comparison of structural CSP decomposition methods
Artificial Intelligence
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Algorithms for a temporal decoupling problem in multi-agent planning
Eighteenth national conference on Artificial intelligence
Constraint Processing
Group decision making and temporal reasoning
Group decision making and temporal reasoning
Fault tolerant mechanism design
Artificial Intelligence
A domain decomposition algorithm for constraint satisfaction
Journal of Experimental Algorithmics (JEA)
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Computationally feasible VCG mechanisms
Journal of Artificial Intelligence Research
Constraint partitioning in penalty formulations for solving temporal planning problems
Artificial Intelligence
Concurrently decomposable constraint systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Distributed algorithms for solving the multiagent temporal decoupling problem
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Maximum Flexibility and Optimal Decoupling in Task Scheduling Problems
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Flexibility and decoupling in the simple temporal problem
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents may lose some flexibility, but their course of action will be more predictable and often also more efficient, obtaining a socially optimal outcome instead of a local optimum. One way to resolve conflicts beforehand is to give extra constraints to each of the agents such that when they all meet these constraints, the resulting execution is conflict-free. A set of constraints that meets this requirement is called a decoupling of the original problem; if it also maximizes the social welfare (i.e. the sum of the valuations of all the agents), it is called optimal. Representing interesting multiagent problems as a constraint problem, we show that finding an optimal decoupling is at least as hard as finding a solution for the constraint problem. We therefore focus on a constraint problem that is efficiently solvable, but still very relevant and interesting in the context of multiple agents executing their actions, i.e. the Simple Temporal Problem (STP). Two more technical results, then, are that we resolve the open question whether finding an optimal decoupling of the STP is NP-hard (it is), and if all agents have linear valuation functions, this decoupling problem can be solved efficiently.