A new equilibrium concept uses optimal-transport ambiguity sets to make agents robust to uncertain aggregate behavior in convex aggregative games, yielding better decisions and sometimes lower costs in EV charging applications.
Nash equilibrium seeking for a class of quadratic-bilinear Wasserstein distributionally robust games
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Hybrid momentum-switching algorithms improve convergence speed over standard aGRAAL for monotone variational inequalities.
citing papers explorer
-
Strategically Robust Aggregative Games
A new equilibrium concept uses optimal-transport ambiguity sets to make agents robust to uncertain aggregate behavior in convex aggregative games, yielding better decisions and sometimes lower costs in EV charging applications.
-
A Hybrid Algorithm for Monotone Variational Inequalities
Hybrid momentum-switching algorithms improve convergence speed over standard aGRAAL for monotone variational inequalities.