Planning for conjunctive goals
Artificial Intelligence
Planning as search: a quantitative approach
Artificial Intelligence
Exploiting constraints in design synthesis
Exploiting constraints in design synthesis
Impediments to universal preference-based default theories
Artificial Intelligence - Special issue on knowledge representation
Efficient resource-bounded reasoning in AT-RALPH
Proceedings of the first international conference on Artificial intelligence planning systems
Proceedings of the first international conference on Artificial intelligence planning systems
A theory of conflict resolution in planning
Artificial Intelligence - Special volume on constraint-based reasoning
Reaching agreement through partial revelation of preferences
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Multiagent negotiation under time constraints
Multiagent negotiation under time constraints
Theory and algorithms for plan merging
Artificial Intelligence
Divide and conquer in multi-agent planning
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Computer Model of Skill Acquisition
A Computer Model of Skill Acquisition
A framework for problem-solving in a distributed processing environment.
A framework for problem-solving in a distributed processing environment.
A framework for organizational self-design in distributed problem solving networks
A framework for organizational self-design in distributed problem solving networks
Deriving multi-agent coordination through filtering strategies
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A cost-directed planner: preliminary report
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
On the robustness of preference aggregation in noisy environments
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Computing the Banzhaf power index in network flow games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
Algorithms for the coalitional manipulation problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for the coalitional manipulation problem
Artificial Intelligence
Power in threshold network flow games
Autonomous Agents and Multi-Agent Systems
The learnability of voting rules
Artificial Intelligence
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Junta distributions and the average-case complexity of manipulating elections
Journal of Artificial Intelligence Research
Complexity of strategic behavior in multi-winner elections
Journal of Artificial Intelligence Research
Multi-winner elections: complexity of manipulation, control, and winner-determination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Llull and Copeland voting computationally resist bribery and constructive control
Journal of Artificial Intelligence Research
How hard is bribery in elections?
Journal of Artificial Intelligence Research
Equilibria of plurality voting with abstentions
Proceedings of the 11th ACM conference on Electronic commerce
Manipulation of copeland elections
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Using complexity to protect elections
Communications of the ACM
Information and Computation
Plan representation and execution in multi-actor scenarios by means of social commitments
Web Intelligence and Agent Systems
False-name manipulations in weighted voting games
Journal of Artificial Intelligence Research
Homogeneity and monotonicity of distance-rationalizable voting rules
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
The complexity of voter partition in Bucklin and fallback voting: solving three open problems
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Manipulating the quota in weighted voting games
Artificial Intelligence
Voting in cooperative information agent scenarios: use and abuse
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
The distortion of cardinal preferences in voting
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
Cloning in elections: finding the possible winners
Journal of Artificial Intelligence Research
Clone structures in voters' preferences
Proceedings of the 13th ACM Conference on Electronic Commerce
The complexity of safe manipulation under scoring rules
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
On the complexity of voting manipulation under randomized tie-breaking
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Optimal manipulation of voting rules
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Proof systems and transformation games
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.02 |
The subject of multi‐agent planning has been of continuing concern in Distributed Artificial Intelligence (DAI). In this paper, we suggest an approach to multi‐agent planning that contains heuristic elements. Our method makes use of subgoals, and derived sub‐plans, to construct a global plan. Agents solve their individual sub‐plans, which are then merged into a global plan. The suggested approach reduces overall planning time and derives a plan that approximates the optimal global plan that would have been derived by a central planner, given those original subgoals. We explore three different scenarios. The first involves a group of agents with a common goal. The second considers how agents can interleave planning and execution when planning towards a common, though dynamic, goal. The third examines the case where agents, each with their own goal, can plan together to reach a state in consensus for the group. Finally, we consider how these approaches can be adapted to handle rational, manipulative agents.