mlsanityData to 7 Oct 2026

End-to-End Learning and Intervention in Games

arXiv 2010.13834 ↗First posted 26 Oct 2020cs.LG cs.GTcited by 19

Not on the map. Why?

Abstract (arXiv)

In a social system, the self-interest of agents can be detrimental to the collective good, sometimes leading to social dilemmas. To resolve such a conflict, a central designer may intervene by either redesigning the system or incentivizing the agents to change their behaviors. To be effective, the designer must anticipate how the agents react to the intervention, which is dictated by their often unknown payoff functions. Therefore, learning about the agents is a prerequisite for intervention. In this paper, we provide a unified framework for learning and intervention in games. We cast the equilibria of games as individual layers and integrate them into an end-to-end optimization framework. To enable the backward propagation through the equilibria of games, we propose two approaches, respectively based on explicit and implicit differentiation. Specifically, we cast the equilibria as the solutions to variational inequalities (VIs). The explicit approach unrolls the projection method for solving VIs, while the implicit approach exploits the sensitivity of the solutions to VIs. At the core of both approaches is the differentiation through a projection operator. Moreover, we establish the correctness of both approaches and identify the conditions under which one approach is more desirable than the other. The analytical results are validated using several real-world problems.

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

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

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

19 papers.

Sort:

By area:

  1. 2021SoK: Machine Learning Governancecited by 9
  2. 2021Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergencecited by 8
  3. 2021Is Nash Equilibrium Approximator Learnable?cited by 4
  4. 2022Differentiable Bilevel Programming for Stackelberg Congestion Gamescited by 4
  5. 2024WardropNet: Traffic Flow Predictions via Equilibrium-Augmented Learningcited by 3
  6. 2026Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimizationcited by 3
  7. 2024Learning to Steer Markovian Agents under Model Uncertaintycited by 2
  8. 2022Beyond NaN: Resiliency of Optimization Layers in The Face of Infeasibilitycited by 1
  9. 2022Tackling Asymmetric and Circular Sequential Social Dilemmas with Reinforcement Learning and Graph-based Tit-for-Tatcited by 1
  10. 2023Differentiable Arbitrating in Zero-sum Markov Gamescited by 1
  11. 2024Learning Optimal Tax Design in Nonatomic Congestion Gamescited by 1
  12. 2021Operator Splitting for Learning to Predict Equilibria in Convex Gamescited by 0
7 more
  1. 2024Barriers to Welfare Maximization with No-Regret Learningcited by 0
  2. 2024SPO-VCS: An End-to-End Smart Predict-then-Optimize Framework with Alternating Differentiation Method for Relocation Problems in Large-Scale Vehicle Crowd Sensingcited by 0
  3. 2025Hypernetwork-based approach for optimal composition design in partially controlled multi-agent systemscited by 0
  4. 2025From Sequential to Recursive: Enhancing Decision-Focused Learning with Bidirectional Feedbackcited by 0
  5. 2026Deep Incentive Design with Differentiable Equilibrium Blockscited by 0
  6. 2026Beyond Local vs. External: A Game-Theoretic Framework for Trustworthy Knowledge Acquisitioncited by 0
  7. 2026Semiparametric Efficient Bilevel Gradient Estimationcited by 0