Inferring Foresightedness in Dynamic Noncooperative Games
Cade Armstrong, Ryan Park, Xinjie Liu, Kushagra Gupta, and David Fridovich-Keil

TL;DR
This paper introduces a method to infer agents' foresightedness in dynamic games, improving behavioral modeling accuracy by 33% through inverse game theory and data-driven estimation.
Contribution
It presents a novel inverse dynamic game framework that estimates foresightedness from data, enabling safer and more accurate multi-agent interaction modeling.
Findings
Inferred foresightedness improves behavioral prediction accuracy by 33%.
Method successfully applied to synthetic, real-world, and simulated data.
Exploits differentiability of solutions to parametric complementarity problems.
Abstract
Dynamic game theory is an increasingly popular tool for modeling multi-agent, e.g. human-robot, interactions. Game-theoretic models presume that each agent wishes to minimize a private cost function that depends on others' actions. These games typically evolve over a fixed time horizon, specifying how far into the future each agent plans. In practical settings, however, decision-makers may vary in foresightedness, or how much they care about their current cost in relation to their past and future costs. We conjecture that quantifying and estimating each agent's foresightedness from online data will enable safer and more efficient interactions with other agents. To this end, we frame this inference problem as an inverse dynamic game. We consider a specific objective function parametrization that smoothly interpolates myopic and farsighted planning. Games of this form are readily…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications
