Can bounded and self-interested agents be teammates? Application to planning in ad hoc teams

Chandrasekaran, Muthukumaran, Doshi, Prashant, Zeng, Yifeng and Chen, Yingke (2017) Can bounded and self-interested agents be teammates? Application to planning in ad hoc teams. Autonomous Agents and Multi-Agent Systems, 31 (4). pp. 821-860. ISSN 1387-2532

Preview

Text _2016_Can_bounded_and_self_interested_agents_be_teammates_Application_to_planning_in_ad_hoc_teams.pdf - Accepted Version Download (1MB) | Preview

Abstract

Planning for ad hoc teamwork is challenging because it involves agents collaborating without any prior coordination or communication. The focus is on principled methods for a single agent to cooperate with others. This motivates investigating the ad hoc teamwork problem in the context of self-interested decision-making frameworks. Agents engaged in individual decision making in multiagent settings face the task of having to reason about other agents’ actions, which may in turn involve reasoning about others. An established approximation that operationalizes this approach is to bound the infinite nesting from below by introducing level 0 models. For the purposes of this study, individual, self-interested decision making in multiagent settings is modeled using interactive dynamic influence diagrams (I-DID). These are graphical models with the benefit that they naturally offer a factored representation of the problem, allowing agents to ascribe dynamic models to others and reason about them. We demonstrate that an implication of bounded, finitely-nested reasoning by a self-interested agent is that we may not obtain optimal team solutions in cooperative settings, if it is part of a team. We address this limitation by including models at level 0 whose solutions involve reinforcement learning. We show how the learning is integrated into planning in the context of I-DIDs. This facilitates optimal teammate behavior, and we demonstrate its applicability to ad hoc teamwork on several problem domains and configurations.

Actions (login required)

View Item

Downloads