Leading multiple ad hoc teammates in joint action settings

Noa Agmon, Peter Stone

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


The growing use of autonomous agents in practice may require agents to cooperate as a team in situations where they have limited prior knowledge about one another, cannot communicate directly, or do not share the same world models. These situations raise the need to design ad hoc team members, i.e., agents that will be able to cooperate without coordination in order to reach an optimal team behavior. This paper considers problem of leading N-agent teams by a single agent toward their optimal joint utility, where the agents compute their next actions based only on their most recent observations of their teammates' actions. We show that compared to previous results in two-agent teams, in larger teams the agent might not be able to lead the team to the action with maximal joint utility. In these cases, the agent's optimal strategy leads the team to the best possible reachable cycle of joint actions. We describe a graphical model of the problem and a polynomial time algorithm for solving it. We then consider the problem of leading teams where the agents' base their actions on a longer history of past observations, showing that the an upper bound computation time exponential in the memory size is very likely to be tight.

Original languageEnglish
Title of host publicationInteractive Decision Theory and Game Theory - Papers from the 2011 AAAI Workshop, Technical Report
Number of pages7
StatePublished - 2011
Event2011 AAAI Workshop - San Francisco, CA, United States
Duration: 8 Aug 20118 Aug 2011

Publication series

NameAAAI Workshop - Technical Report


Conference2011 AAAI Workshop
Country/TerritoryUnited States
CitySan Francisco, CA

All Science Journal Classification (ASJC) codes

  • General Engineering


Dive into the research topics of 'Leading multiple ad hoc teammates in joint action settings'. Together they form a unique fingerprint.

Cite this