Communicating with unknown teammates

Samuel Barrett, Noa Agmon, Noam Hazon, Sarit Kraus, Peter Stone

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Past research has investigated a number of methods for coordinating teams of agents, but, with the growing number of sources of agents, it is likely that agents will encounter teammates that do not share their coordination methods. Therefore, it is desirable for agents to form an effective ad hoc team. This research tackles the problem of communication in ad hoc teams, introducing a minimal version of the multiagent, multi-armed bandit problem with limited communication between the agents. This abstract summarizes theoretical results that prove that this problem setting can be solved in polynomial time when the agent knows the set of possible teammates, and the empirical results that show that the problems can be solved in practice.

Original languageEnglish
Title of host publication13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1433-1434
Number of pages2
ISBN (Electronic)9781634391313
StatePublished - 2014
Event13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 - Paris, France
Duration: 5 May 20149 May 2014

Publication series

Name13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
Volume2

Conference

Conference13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
Country/TerritoryFrance
CityParis
Period5/05/149/05/14

Bibliographical note

Publisher Copyright:
Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.

Fingerprint

Dive into the research topics of 'Communicating with unknown teammates'. Together they form a unique fingerprint.

Cite this