Sciweavers

34 search results - page 1 / 7
» Achieving goals in decentralized POMDPs
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Achieving goals in decentralized POMDPs
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
Christopher Amato, Shlomo Zilberstein
IJCAI
2007
13 years 6 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
ATAL
2009
Springer
13 years 11 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
ATAL
2005
Springer
13 years 10 months ago
Formalizing and achieving multiparty agreements via commitments
Multiparty agreements often arise in a multiagent system where autonomous agents interact with each other to achieve a global goal. Multiparty agreements are traditionally represe...
Feng Wan, Munindar P. Singh
SIGECOM
2005
ACM
106views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
On decentralized incentive compatible mechanisms
Algorithmic Mechanism Design focuses on Dominant Strategy Implementations. The main positive results are the celebrated Vickrey-Clarke-Groves (VCG) mechanisms and computationally ...
Ahuva Mu'alem