Learning Game-Theoretic Models of Multiagent Trajectories Using Implicit Layers

16Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

For prediction of interacting agents’ trajectories, we propose an end-to-end trainable architecture that hybridizes neural nets with game-theoretic reasoning, has interpretable intermediate representations, and transfers to downstream decision making. It uses a net that reveals preferences from the agents’ past joint trajectory, and a differentiable implicit layer that maps these preferences to local Nash equilibria, forming the modes of the predicted future trajectory. Additionally, it learns an equilibrium refinement concept. For tractability, we introduce a new class of continuous potential games and an equilibrium-separating partition of the action space. We provide theoretical results for explicit gradients and soundness. In experiments, we evaluate our approach on two real-world data sets, where we predict highway drivers’ merging trajectories, and on a simple decision-making transfer task.

Cite

CITATION STYLE

APA

Geiger, P., & Straehle, C. N. (2021). Learning Game-Theoretic Models of Multiagent Trajectories Using Implicit Layers. In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 6A, pp. 4950–4958). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v35i6.16628

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free