Agent influence as a predictor of difficulty for decentralized problem-solving

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 688-693

  Allen, Martin ^a   Zilberstein, Shlomo ^a  

^a The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECENTRALIZED PROBLEMS; MULTIAGENT PROBLEMS; TASK DECOMPOSITIONS;

ALGORITHMS; DECISION MAKING; DYNAMIC PROGRAMMING; HEURISTIC METHODS; INTELLIGENT AGENTS;

PROBLEM SOLVING;

EID: 36349036008     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Becker, R.; Zilberstein, S.; Lesser, V.; and Goldman, C. V. 2004. Solving transition independent decentralized MDPs. Journal of Artificial Intelligence Research 22:423-455.
2. Bernstein, D. S.; Givan, R.; Immerman, N.; and Zilberstein, S. 2002. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research 27(4):819-840.
3. Georgeff, M. 1984. A theory of action for multi-agent planning. In Proceedings of the Fourth National Conference on Artificial Intelligence, 121-125.
4. Hansen, E. A.; Bernstein, D. S.; and Zilberstein, S. 2004. Dynamic programming for partially observable stochastic games. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, 709-715.
5. Kearns, M., and Mansour, Y. 2002. Efficient Nash computation in large population games with bounded influence. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, 259-266.
6. Nair, R.; Tambe, M.; Yokoo, M.; Pynadath, D.; and Marsella, S. 2003. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 705-711.
7. Rabinovich, Z.; Goldman, C. V.; and Rosenschein, J. S. 2003. The complexity of multiagent systems: The price of silence. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, 1102-1103.
8. Ratitch, B., and Precup, D. 2002. Characterizing Markov decision processes. In Proceedings of the Thirteenth European Conference on Machine Learning, 391-404.
9. Seuken, S., and Zilberstein, S. 2005. Formal models and algorithms for decentralized control of multiple agents. Technical Report UM-CS-2005-68, University of Massachusetts, Amherst, Department of Computer Science.
10. Shen, J.; Becker, R.; and Lesser, V. 2006. Agent Interaction in Distributed MDPs and its Implications on Complexity. In Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems, 529-536.
11. Szer, D.; Charpillet, F.; and Zilberstein, S. 2005. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, 576-583.