A heuristic technique for multi-agent planning

DOI10.1023/A:1018924209812zbMath0880.68121OpenAlexW1889721679MaRDI QIDQ1370593

Jeffrey S. Rosenschein, Eithan Ephrati

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)

Related Items (10)

Algorithms for the coalitional manipulation problem ⋮ The learnability of voting rules ⋮ Studies in Computational Aspects of Voting ⋮ Proof systems and transformation games ⋮ The complexity of probabilistic lobbying ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Manipulating the quota in weighted voting games ⋮ 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

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