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.
On data-driven Wasserstein distributionally robust Nash equilibrium problems with heterogeneous uncertainty
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Strategically robust LQ dynamic games reduce to standard LQ games with penalized fictitious adversaries, admitting unique Markovian linear equilibria computable by coupled Riccati equations, with simulations revealing robustness benefits and a free-lunch performance improvement.
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.
-
Strategically Robust Linear Quadratic Dynamic Games
Strategically robust LQ dynamic games reduce to standard LQ games with penalized fictitious adversaries, admitting unique Markovian linear equilibria computable by coupled Riccati equations, with simulations revealing robustness benefits and a free-lunch performance improvement.