15 search results - page 3 / 3 » The selectope for games with partial cooperation |
IJCAI
1989
13 years 6 months ago
1989
Research in Distributed Artificial Intelligence is concerned with how automated agents can be designed to interact effectively. One important capability that could aid inter-agent...
AAAI
2006
13 years 7 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
ECCV
2004
Springer
14 years 7 months ago
2004
Springer
We present a vision based, adaptive, decision theoretic model of human facial displays in interactions. The model is a partially observable Markov decision process, or POMDP. A POM...
ML
2006
ACM
13 years 5 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...