A heuristic technique for multi-agent planning

DOI10.1023/A:1018924209812MaRDI QIDQ1370593zbMATH OpenOpenAlexFDO

Authors Eithan Ephrati, Jeffrey S. Rosenschein

Publication date 26 October 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018924209812

zbMATH Keywords

multi-agent planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A single-agent approach to multiagent planning
• Extending SATPLAN to multiple agents
• scientific article; zbMATH DE number 1929179
• Planning for multiagent using ASP-Prolog
• Distributed heuristic forward search for multi-agent planning

Cited in

(15)

• The complexity of probabilistic lobbying
• The MADLA planner: multi-agent planning by combination of distributed and local heuristic search
• IMPACTing SHOP: Putting an AI planner into a multi-agent environment
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
• Control complexity in Bucklin and fallback voting: a theoretical analysis
• Computational Aspects of Approval Voting
• Studies in Computational Aspects of Voting
• Proof systems and transformation games
• A Bilinear Programming Approach for Multiagent Planning
• Manipulating the quota in weighted voting games
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• Complexity of candidate control for single nontransferable vote and bloc voting
• Heuristic planning: A declarative approach based on strategies for action selection
• Algorithms for the coalitional manipulation problem
• The learnability of voting rules

This page was built for publication: A heuristic technique for multi-agent planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370593)