Valuing search and communication in partially-observable coordination problems

Authors:
Simon A. Williamson;Archie C. Chapman;Nicholas R. Jennings
Affiliations:
University of Southampton, Southampton, UK;University of Southampton, Southampton, UK;University of Southampton, Southampton, UK
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 3
Cited 0

Communication decisions in multi-agent cooperation: model and experiments

Proceedings of the fifth international conference on Autonomous agents
Reward shaping for valuing communications during multi-agent coordination

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Taming decentralized POMDPs: towards efficient policy computation for multiagent settings

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend the class of Bayesian coordination games to include explicit observation and communication. This general class of problems includes the canonical multi-door multi-agent Tiger problem. We argue that this class of games is appropriate for situations where the agents observation, communication and payoff-earning actions are limited by some common resource, without introducing arbitrary penalties for communicating (unlike most existing approaches).