pith. sign in

arxiv: 2604.23669 · v1 · submitted 2026-04-26 · 💻 cs.GT · math.OC

Strategically Robust Aggregative Games

Andreas Feik , Nicolas Lanzetti , Saverio Bolognani , Florian D\"orfler , Dario Paccagnan This is my paper

Pith reviewed 2026-05-08 05:01 UTC · model grok-4.3

classification 💻 cs.GT math.OC
keywords aggregative gamesWardrop equilibriumstrategic robustnessoptimal transportambiguity setselectric vehicle chargingmulti-agent systems
0
0 comments X

The pith

In convex aggregative games, pure strategically robust Wardrop equilibria exist, are computable, and can protect agents from uncertain population behavior while sometimes lowering costs for all.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a new equilibrium notion for settings where agents decide under uncertainty about others' actions, as occurs in traffic routing or electric vehicle charging. Agents guard against the worst-case aggregate population behavior drawn from an optimal-transport ambiguity set centered on the emergent aggregate. In convex aggregative games this produces a pure equilibrium that interpolates between ordinary Wardrop equilibria and fully secure strategies. The authors supply existence proofs and tractable computation methods. An electric-vehicle charging example shows that the resulting decisions improve protection and, surprisingly, can reduce costs for every agent through an induced coordination effect.

Core claim

In convex aggregative games a pure strategically robust Wardrop equilibrium exists. Each agent best-responds to the worst-case aggregate behavior inside an optimal-transport-based ambiguity set centered at the population's emergent aggregate. This construction yields equilibria that are computable by standard methods and, in the electric-vehicle application, produce decisions that shield agents from aggregate uncertainty while sometimes generating lower individual costs for the entire population.

What carries the argument

Strategically robust Wardrop equilibrium, in which every agent optimizes against the worst-case aggregate inside an optimal-transport ambiguity ball centered on the emergent population behavior.

If this is right

  • Pure equilibria exist for every convex aggregative game and every robustness level.
  • Standard convex optimization or fixed-point algorithms suffice to compute the equilibria.
  • In electric-vehicle charging the equilibria yield decisions that remain effective under deviations in total demand.
  • Increasing the robustness parameter can reduce every agent's equilibrium cost, producing a coordination-via-robustification effect.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same construction may apply to aggregative games on networks if the aggregate map remains convex.
  • System designers could treat the robustness radius as a tunable parameter to balance efficiency against resilience.
  • The observed cost reduction suggests that requiring protection against aggregate uncertainty can substitute for explicit coordination mechanisms.

Load-bearing premise

Agents protect directly against deviations around the emergent aggregate behavior by using an optimal-transport ambiguity set rather than modeling every source of uncertainty explicitly.

What would settle it

A convex aggregative game in which, for some positive robustness level, no pure strategy profile satisfies the mutual best-response condition under the optimal-transport ambiguity set, or an electric-vehicle instance in which robust equilibria produce strictly higher costs than ordinary Wardrop equilibria for at least one agent.

Figures

Figures reproduced from arXiv: 2604.23669 by Andreas Feik, Dario Paccagnan, Florian D\"orfler, Nicolas Lanzetti, Saverio Bolognani.

Figure 1
Figure 1. Figure 1: Total demand of electricity (i.e., aggregative demand view at source ↗
Figure 5
Figure 5. Figure 5: Price of anarchy as a function of the robustness level ε. For ε = 1.2 the price of anarchy is 1 and players coordinate to minimize social cost. B. Strategically Robust EV Charging Policies We show the demand for electricity in view at source ↗
read the original abstract

In many multiagent settings, such as electric vehicle charging and traffic routing, agents must make decisions in the face of uncertain behavior exhibited by others. Often, this uncertainty arises from multiple sources, such as incomplete information, limited computation, or bounded rationality, ultimately impacting the aggregate behavior. To tackle this challenge, we follow recent work on strategically robust game theory and postulate that agents seek protection directly against deviations around the emergent behavior, as opposed to explicitly modeling all sources of uncertainty. Specifically, we propose that each agent protects itself against the worst-case aggregate behavior within an optimal-transport-based ambiguity set centered at the emergent aggregate population behavior. This leads to a novel equilibrium concept, called strategically robust Wardrop equilibrium, that enables one to interpolate between standard Wardrop equilibria (no robustness) and security strategies (maximum robustness). In the setting of convex aggregative games, we establish the existence of a pure strategically robust Wardrop equilibrium and provide tractable computational tools for computing it. Through an application in electric vehicle charging, we demonstrate that strategically robust Wardrop equilibria lead to better decisions, protecting agents against the uncertain aggregate behavior of the population. Remarkably, we also observe that strategic robustness can lead to lower equilibrium costs for all agents, uncovering a "coordination-via-robustification" effect.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper introduces strategically robust Wardrop equilibria for convex aggregative games. Agents protect against worst-case deviations in aggregate behavior via an optimal-transport ambiguity set centered at the candidate equilibrium aggregate. The central claims are existence of pure equilibria (via a fixed-point argument on the robustified best-response map) and tractable computation of such equilibria. An EV-charging application is used to illustrate that the equilibria protect against population uncertainty and, surprisingly, can produce lower costs for every agent than the classical Wardrop equilibrium.

Significance. If the existence and computational results hold, the work supplies a clean interpolation between ordinary Wardrop equilibria (zero robustness) and security strategies (maximum robustness) while preserving the aggregative structure that makes computation feasible. The endogenous centering of the ambiguity set is internally consistent with the equilibrium definition and avoids the usual explosion in dimensionality that arises when uncertainty is modeled exogenously. The reported coordination-via-robustification effect in the EV example is a falsifiable prediction that could be tested in other aggregative settings.

minor comments (3)
  1. [Abstract] The abstract and introduction state that 'tractable computational tools' are provided, yet the precise algorithmic description (e.g., whether a variational inequality, projected fixed-point iteration, or cutting-plane method is used) appears only later; a one-sentence pointer in the abstract would improve readability.
  2. [Section 5] In the EV-charging numerical study, the radius of the OT ball is treated as a free parameter; the paper should report the sensitivity of both the equilibrium cost reduction and the coordination effect to this radius (or supply a data-driven rule for its selection).
  3. [Section 2] Notation for the ambiguity set (center, radius, OT cost) is introduced piecemeal; a single consolidated notation table or paragraph early in the paper would reduce cross-referencing.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and insightful review, which accurately summarizes the paper's contributions on strategically robust Wardrop equilibria in convex aggregative games. We are pleased that the referee recognizes the value of the endogenous optimal-transport ambiguity sets, the existence and computational results, and the coordination-via-robustification phenomenon observed in the EV-charging application. We will incorporate minor revisions to address any editorial suggestions in the revised manuscript.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper introduces the strategically robust Wardrop equilibrium by defining each agent's cost as the worst-case value over an OT ambiguity set centered at the candidate aggregate, then establishes existence of a pure equilibrium via a standard fixed-point argument on the best-response map in convex aggregative games. This is a self-contained construction relying on convexity, compactness of the ambiguity set, and continuity of the worst-case cost; it does not reduce by the paper's equations to a fitted input, a renamed known result, or a load-bearing self-citation chain. Computational tools and the EV-charging application follow directly from solving the resulting variational inequality without circular reduction to the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

Central claims rest on the domain assumption of convex aggregative games and the ad-hoc modeling choice of optimal-transport ambiguity sets; no free parameters or invented physical entities are mentioned.

axioms (2)
  • domain assumption The setting consists of convex aggregative games.
    Explicitly stated as the regime in which existence and computation are established.
  • ad hoc to paper Agents protect against worst-case aggregate behavior within an optimal-transport-based ambiguity set centered at the emergent aggregate population behavior.
    Core modeling postulate that defines the new equilibrium concept.
invented entities (1)
  • Strategically robust Wardrop equilibrium no independent evidence
    purpose: Equilibrium concept that incorporates robustness to aggregate uncertainty via ambiguity sets.
    Newly defined in the paper to interpolate between standard Wardrop and security strategies.

pith-pipeline@v0.9.0 · 5536 in / 1402 out tokens · 45624 ms · 2026-05-08T05:01:13.593882+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 4 canonical work pages

  1. [1]

    Robust game theory,

    M. Aghassi and D. Bertsimas, “Robust game theory,”Mathematical Programming, vol. 107, no. 1, pp. 231–273, 2006

    2006

  2. [2]

    Wardrop equilibria with risk-averse users,

    F. Ord´onez and N. E. Stier-Moses, “Wardrop equilibria with risk-averse users,”Transportation science, vol. 44, no. 1, pp. 63–86, 2010

    2010

  3. [3]

    Distributionally Robust Game Theory

    N. Loizou, “Distributionally robust game theory,”arXiv preprint arXiv:1512.03253, 2015

    work page Pith review arXiv 2015

  4. [4]

    Distributionally robust games: f- divergence and learning,

    D. Bauso, J. Gao, and H. Tembine, “Distributionally robust games: f- divergence and learning,” inProceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, 2017, pp. 148–155

    2017

  5. [5]

    Games with distributionally robust joint chance constraints,

    S. Peng, A. Lisser, V . V . Singh, N. Gupta, and E. Balachandar, “Games with distributionally robust joint chance constraints,”Optimization Letters, vol. 15, no. 6, pp. 1931–1953, 2021

    1931

  6. [6]

    Nash equilibrium seeking for a class of quadratic-bilinear Wasserstein distributionally robust games,

    G. Pantazis, R. R. Bahbadorani, and S. Grammatico, “Nash equilibrium seeking for a class of quadratic-bilinear Wasserstein distributionally robust games,”arXiv preprint arXiv:2411.09636, 2024

    work page arXiv 2024

  7. [7]

    On data-driven Wasserstein distributionally robust Nash equilibrium problems with heterogeneous uncertainty,

    G. Pantazis, B. Franci, and S. Grammatico, “On data-driven Wasserstein distributionally robust Nash equilibrium problems with heterogeneous uncertainty,”arXiv preprint arXiv:2312.03573, 2023

    work page arXiv 2023

  8. [8]

    Solving decision-dependent games by learning from feedback,

    K. Wood, A. Zamzam, and E. Dall’Anese, “Solving decision-dependent games by learning from feedback,”IEEE Open Journal of Control Systems, 2024

    2024

  9. [9]

    Lanzetti, S

    N. Lanzetti, S. Fricker, S. Bolognani, F. D ¨orfler, and D. Paccagnan, “Strategically robust game theory via optimal transport,”arXiv preprint arXiv:2507.15325, 2025

    work page arXiv 2025

  10. [10]

    Villaniet al.,Optimal transport: old and new

    C. Villaniet al.,Optimal transport: old and new. Springer, 2008, vol. 338

    2008

  11. [11]

    Nash and Wardrop equilibria in aggregative games with coupling constraints,

    D. Paccagnan, B. Gentile, F. Parise, M. Kamgarpour, and J. Lygeros, “Nash and Wardrop equilibria in aggregative games with coupling constraints,”IEEE Transactions on Automatic Control, vol. 64, no. 4, pp. 1373–1388, 2018

    2018

  12. [12]

    Facchinei and J.-S

    F. Facchinei and J.-S. Pang,Finite-dimensional variational inequalities and complementarity problems. Springer, 2003

    2003

  13. [13]

    Distributionally robust stochastic optimiza- tion with Wasserstein distance,

    R. Gao and A. Kleywegt, “Distributionally robust stochastic optimiza- tion with Wasserstein distance,”Mathematics of Operations Research, vol. 48, no. 2, pp. 603–655, 2023

    2023

  14. [14]

    Decentralized charging control of large populations of plug-in electric vehicles,

    Z. Ma, D. S. Callaway, and I. A. Hiskens, “Decentralized charging control of large populations of plug-in electric vehicles,”IEEE Transactions on Control Systems Technology, vol. 21, no. 1, pp. 67–78, 2011

    2011

  15. [15]

    Convex optimization, game theory, and variational inequality theory,

    G. Scutari, D. P. Palomar, F. Facchinei, and J.-S. Pang, “Convex optimization, game theory, and variational inequality theory,”IEEE Signal Processing Magazine, vol. 27, no. 3, pp. 35–49, 2010

    2010

  16. [16]

    A unified theory of robust and distributionally robust optimization via the primal-worst-equals-dual- best principle,

    J. Zhen, D. Kuhn, and W. Wiesemann, “A unified theory of robust and distributionally robust optimization via the primal-worst-equals-dual- best principle,”Operations Research, 2023

    2023

  17. [17]

    On the efficiency of Nash equilibria in aggregative charging games,

    D. Paccagnan, F. Parise, and J. Lygeros, “On the efficiency of Nash equilibria in aggregative charging games,”IEEE Control Systems Letters, vol. 2, no. 4, pp. 629–634, 2018

    2018

  18. [18]

    CVXPY: A Python-embedded modeling language for convex optimization,

    S. Diamond and S. Boyd, “CVXPY: A Python-embedded modeling language for convex optimization,”Journal of Machine Learning Research, vol. 17, no. 83, pp. 1–5, 2016

    2016

  19. [19]

    Version 11.0., 2025

    MOSEK ApS,The MOSEK Optimization Toolbox for Python Manual. Version 11.0., 2025. [Online]. Available: https://docs.mosek.com/11.0/ pythonapi/index.html

    2025

  20. [20]

    Tractable multi-agent rein- forcement learning through behavioral economics,

    E. Mazumdar, K. Panaganti, and L. Shi, “Tractable multi-agent rein- forcement learning through behavioral economics,” inThe Thirteenth International Conference on Learning Representations, 2025

    2025

  21. [21]

    Convergent q-learning for infinite-horizon general-sum markov games through behavioral economics,

    Y . Zhang and E. Mazumdar, “Convergent q-learning for infinite-horizon general-sum markov games through behavioral economics,” in2025 IEEE 64th Conference on Decision and Control (CDC). IEEE, 2025, pp. 5899–5904

    2025

  22. [22]

    R. K. Sundaram,A first course in optimization theory. Cambridge University Press, 1996

    1996

  23. [23]

    C. D. Aliprantis and K. C. Border,Infinite dimensional analysis: a hitchhiker’s guide. Springer Science & Business Media, 2006

    2006

  24. [24]

    Distributionally robust optimization,

    D. Kuhn, S. Shafiee, and W. Wiesemann, “Distributionally robust optimization,”Acta Numerica, vol. 34, pp. 579–804, 2025

    2025

  25. [25]

    Boyd and L

    S. Boyd and L. Vandenberghe,Convex Optimization. Cambridge University Press, 2004. APPENDIX A. Proof of Theorem 1 We split the proof into four steps. Throughout the proof, let X :=X 1 × · · · × X N and ¯Xσ =σ(X) . In general, ¯Xσ need not coincide with Xσ, as we defined the former to be the image of X through σ (i.e., ¯Xσ is the set of all possible values...

    2004