2026
Constraint Learning in Multi-Agent Dynamic Games From Demonstrations of Local Nash Interactions
RA-L 2026
We present an inverse dynamic game-based algorithm to learn parametric constraints from a given dataset of local Nash equilibrium interactions between multiple agents. Specifically, we introduce mixed-integer linear programs (MILP) encoding the Karush–Kuhn–Tucker (KKT) conditions of the interacting