mlsanityData to 7 Oct 2026

Learning Game-Theoretic Models of Multiagent Trajectories Using Implicit Layers

arXiv 2008.07303 ↗First posted 17 Aug 2020cs.GT cs.AI cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

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 driver merging trajectories, and on a simple decision-making transfer task.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 1; 2023: 5; 2024: 2; 2025: 0; 2026: 1.

13 papers.

Sort:

By area: