268 search results - page 19 / 54 » Solving multiagent assignment Markov decision processes |
IJCAI
2003
15 years 1 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
103
click to vote
AIPS
1998
15 years 1 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
UAI
2003
15 years 1 months ago
2003
This paper examines a number of solution methods for decision processes with non-Markovian rewards (NMRDPs). They all exploit a temporal logic specification of the reward functio...
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
114
Voted
SOCO
2010
Springer
14 years 6 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...