Pith. sign in

REVIEW 5 minor 2 cited by

Strategically Robust Game Theory via Optimal Transport

T0 review · 0 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Strategically robust equilibria exist wherever Nash equilibria do, and computing them is no harder than computing a Nash equilibrium.

desk verdict A genuinely new equilibrium concept with solid existence and PPAD membership; the strong-duality worry doesn't land, and the only real issue is a cosmetic gap in the displayed KKT conditions. read the letter →

arxiv 2507.15325 v1 pith:AHOGZ5F6 submitted 2025-07-21 cs.GT math.OC

Nicolas Lanzetti , Sylvain Fricker , Saverio Bolognani , Florian Dörfler , Dario Paccagnan This is my paper
classification cs.GTmath.OC MSC 91A1091A8049Q2290C47
keywords strategicallyrobustequilibriumoptimaltransportWassersteinambiguitysetdistributionallyoptimizationNashsecuritystrategyPPADcomplexityconcavegames
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper introduces a new equilibrium notion, the strategically robust equilibrium (SRE), in which each agent maximizes expected payoff against the worst-case distribution over others' actions within a tunable Wasserstein ball centered at the equilibrium itself. The paper claims that SREs exist under exactly the same assumptions that guarantee mixed Nash equilibria, that computing a delta-approximate SRE lies in PPAD (no harder than Nash), and that for concave games a pure SRE always exists. These results matter because they suggest decision-makers can hedge against misspecification, bounded rationality, or out-of-equilibrium play at no extra computational cost, and experiments show the robust equilibria often yield higher payoffs for all agents.

What carries the argument

The central object is the optimal-transport (Wasserstein) ambiguity set $B_i^\varepsilon(p_{-i}) = \{\sigma_{-i} : W_s(\sigma_{p_{-i}}, \sigma_{-i}) \le \varepsilon\}$, a ball of distributions around the product of the others' mixed strategies. It interpolates between Nash equilibria ($\varepsilon=0$) and security strategies ($\varepsilon\to\infty$) while remaining hemicontinuous (Lemma 1), which is what guarantees existence under minimal assumptions. The argument then uses strong duality for Wasserstein distributionally robust optimization to reformulate the strategically robust best response as a single convex program (Proposition 1), and reduces the SRE problem to a concave game so that known PPAD complexity results for concave games apply.

What would settle it

Take a two-player continuous-action game (e.g., compact intervals) with a ground cost d that satisfies the triangle inequality but is not lower semicontinuous, and for a fixed opponent strategy $p_{-i}$ compute both the primal value $\min_{\sigma \in \text{ball}} U_i(p_i, \sigma)$ and the dual expression in Proposition 1; if the difference is nonzero, the dual reformulation fails and with it the arguments for existence and PPAD membership in the continuous setting. Alternatively, search over finite 3x3 games and a fine grid of $\varepsilon$ for a game where the linear complementarity problem of Proposition 2 has no solution, which would contradict Corollary 1.

Watch

Extended reading notes

Core claim

The authors prove that strategically robust equilibria based on optimal transport ambiguity sets exist under the same assumptions as mixed Nash equilibria (Corollary 1), and that computing a delta-approximate SRE is in PPAD, so it is no harder than computing a Nash equilibrium (Theorem 2). For concave games, pure SREs exist (Theorem 3) and can be computed as Nash equilibria of a surrogate concave game with augmented action space. The key step is dualizing the worst-case distribution in a Wasserstein ball, which turns each agent's max-min best response into a single convex program; this dual also reveals that robustness acts like a regularization of payoffs, which in examples leads to coordination and higher equilibrium payoffs for every agent.

Load-bearing premise

The central reformulation assumes strong duality holds for the Wasserstein distributionally robust optimization problem inside each agent's best response, requiring the ground cost to be lower semicontinuous and the action space to be Polish; the paper applies this to continuous action spaces without fully verifying these conditions, and a failure of duality would break the existence-by-same-assumptions and no-extra-cost claims.

Editorial extensions

If this is right

  • Wherever mixed Nash equilibria exist, strategically robust equilibria exist too, so robustness can be added without losing existence guarantees.
  • Computing a $\delta$-approximate strategically robust equilibrium is in PPAD, so algorithms and solvers used for Nash equilibria (e.g., LCP, homotopy methods) can be reused.
  • The tunable parameter $\varepsilon$ lets an agent or designer move continuously between Nash play and security play, giving a principled way to choose the level of worst-case protection.
  • In concave games, pure SREs exist and robustness appears as a regularization term in payoffs, e.g., inflating marginal costs in Cournot competition.
  • In experiments, strategic robustness often raises payoffs for all agents (coordination via robustification) and lowers the price of anarchy in congestion games.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The family of SREs parameterized by $\varepsilon$ defines a homotopy from Nash to security equilibria, which could serve as an equilibrium-selection device in games with multiple Nash equilibria.
  • Because robustness behaves like payoff regularization, SREs could be used to design taxes or prices in congestion games that improve efficiency without needing an accurate model of player behavior.
  • The duality-based reformulation relies on strong duality for Wasserstein DRO; for continuous action spaces the paper applies it without verifying all technical conditions, and a nonzero duality gap would break the 'no extra computational cost' claim.
  • The coordination-via-robustification effect is demonstrated numerically; a theoretical characterization of game classes in which robustness raises all players' payoffs would be a natural next step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper introduces a new equilibrium notion, called strategically robust equilibrium (SRE), in which each player maximizes expected payoff against the worst-case strategy profile contained in an optimal-transport ambiguity ball centered at the other players' equilibrium strategies. The main theoretical results are: (i) an existence theorem for general ambiguity sets under a hemicontinuity condition (Theorem 1), specialized to optimal-transport ambiguity sets under the same assumptions needed for mixed Nash equilibria (Corollary 1); (ii) a dual reformulation of the robust best response (Proposition 1); (iii) a PPAD membership result for computing approximate SRE in finite games (Theorem 2); (iv) an equivalent multilinear complementarity formulation, which becomes linear in two-player games (Proposition 2); and (v) existence of pure SRE in concave games together with an equivalent concave surrogate game (Theorem 3 and Proposition 3). The paper also provides numerical experiments on bi-matrix games, congestion games, and Cournot competition, illustrating robustness and the reported 'coordination via robustification' effect.

Significance. If the results hold, this is a substantial contribution: it bridges distributionally robust optimization and equilibrium analysis, and it shows that a robust non-Nash equilibrium notion can have the same existence guarantees and the same worst-case computational complexity as mixed Nash equilibrium. The proofs are detailed and use standard tools (Glicksberg's fixed point theorem, Berge's maximum theorem, Wasserstein DRO duality, and recent concave-game complexity results). The paper ships reproducible code for the numerical experiments, which is a concrete strength. I also checked the main technical risk identified by the reader—the dependence of Proposition 1/5 on strong duality for Wasserstein distributionally robust optimization—and under the paper's standing assumptions (compact Polish spaces, continuous payoffs, and a metric ground distance) the Blanchet-Murthy duality hypotheses are satisfied, so this is not a defect. The only free parameters are the radius epsilon and the order s; no ad-hoc assumptions are introduced.

minor comments (5)
  1. [Proposition 2, equations (8)-(9)] The displayed optimality system omits the primal feasibility constraint sum_{a_i} p_i(a_i)=1, so the literal condition would admit p_i=0. Please add the simplex equality to the statement of Proposition 2 or explicitly include 'together with p_i in Delta_i' in the equivalence, matching the LP (7) from which the KKT conditions are derived.
  2. [Appendix A.2, proof of Lemma 2] In the proof of continuity of the product map, the second displayed integral is written as int phi_1 dmu_n again, but it should be int phi_2 dnu_n; this is a typographical error in an otherwise correct argument.
  3. [Corollary 2] The constraint is stated as f_i^k(a_{-i}) <= 0, but the conjugate terms and the surrounding discussion require f_i^k to be a function of the agent's own action a_i (or of the relevant block a_j for j != i); please correct the index.
  4. [Theorem 2 proof] The use of Fearnley et al. (2022, Theorem E.2) to approximate the surrogate payoff by a linear arithmetic circuit is only acknowledged through a footnote about an additional precision term; please state explicitly how the approximation accuracy is chosen relative to delta so that the final delta-approximate SRE guarantee in the chain of inequalities remains valid.
  5. [Theorem 2 and Lemma 3] The type-s Wasserstein order s appears in the computational statements without an input convention; please specify that s is rational (or integer) so that quantities such as epsilon^s and d_{-i}(.,.)^s are polynomial-time computable in the bit complexity model.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the existence, complexity, and reformulation results are derived from external fixed-point, duality, and PPAD theorems, not from their own conclusions.

full rationale

The paper's central claims are self-contained given standard external tools and do not reduce to their inputs by construction. Definition 1 defines a strategically robust equilibrium as a fixed point of a max-min best-response map, exactly analogous to Nash equilibrium; this is a definition, not a hidden use of the target result. Theorem 1 proves existence via continuity and concavity of the robust payoff and Glicksberg's theorem, with ambiguity-set hemicontinuity supplied by Lemma 1; Lemma 1 is proved from standard optimal-transport facts (lower semicontinuity of the Wasserstein distance, compactness of the probability space, and interpolation/convexity), not from the equilibrium notion. Proposition 1 and its general version Proposition 5 invoke the external Blanchet–Murthy strong-duality theorem for distributionally robust optimization; the paper's standing assumptions (compact Polish action spaces, continuous payoffs, proper distance cost) match that theorem's hypotheses, and in finite games the step reduces to finite LP duality. Theorem 2 reduces computing a strategically robust equilibrium to finding an equilibrium of an explicitly constructed concave game and then cites the external PPAD result of Papadimitriou et al. (2023); the reduction is written out in full and does not assume the desired PPAD membership. Theorem 3 similarly constructs a surrogate concave game and applies Rosen's classical existence theorem. The claimed interpolation between Nash and security strategies follows directly from the definition at ε=0 and ε→∞, and is presented as a defining property rather than an independent empirical prediction. The only self-citations (Gairing and Paccagnan 2023, Paccagnan et al. 2018) appear in motivating application contexts and are not load-bearing. No step was found in which an equation is defined in terms of its own conclusion, a fitted parameter is renamed as a prediction, or a conclusion depends on an unverified self-citation chain.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The only tunable knobs are the robustness radius epsilon and the Wasserstein order s; neither is fitted to data. All proofs rely on standard fixed-point, duality, and complexity results. No new physical or data-driven entities are introduced.

free parameters (2)
  • robustness radius epsilon
    The size of the optimal-transport ambiguity set; chosen by the modeler, not fitted to data. It tunes the interpolation between Nash (epsilon=0) and security strategies (epsilon toward infinity).
  • Wasserstein order s
    The order of the Wasserstein distance (s>=1); a modeling choice. Examples use s=1 (total variation) and s=2 (quadratic).
assumptions (5)
  • domain assumption Action spaces are compact Polish spaces and payoffs are continuous (Assumption 1).
    Needed for existence of Nash equilibria and for the fixed-point arguments; this is the same assumption class as Nash.
  • domain assumption Ambiguity sets are non-empty, compact-valued, and hemicontinuous in the center (Assumption 2).
    Required by Theorem 1; for optimal transport balls this is proven in Lemma 1.
  • standard math Strong duality for Wasserstein distributionally robust optimization (Blanchet and Murthy 2019, Theorem 1).
    Used in Proposition 5 and Proposition 1 to reformulate the worst-case expectation as a dual expectation.
  • standard math Fixed point theorems: Glicksberg's theorem and Rosen's theorem for concave games.
    Used in Theorem 1 and Theorem 3 to establish existence of strategically robust equilibria.
  • standard math Papadimitriou et al. (2023) PPAD membership of concave games.
    Used in Theorem 2 to bound the complexity of computing strategically robust equilibria.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Strategically Robust Game Theory via Optimal Transport." pith.science (2026). https://pith.science/paper/AHOGZ5F6

@misc{pith2026250715325,
  author       = {Pith},
  title        = {Pith review of: Strategically Robust Game Theory via Optimal Transport},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AHOGZ5F6}},
  note         = {Machine review of arXiv:2507.15325}
}
read the original abstract

In many game-theoretic settings, agents are challenged with taking decisions against the uncertain behavior exhibited by others. Often, this uncertainty arises from multiple sources, e.g., incomplete information, limited computation, bounded rationality. While it may be possible to guide the agents' decisions by modeling each source, their joint presence makes this task particularly daunting. Toward this goal, it is natural for agents to seek protection against deviations around the emergent behavior itself, which is ultimately impacted by all the above sources of uncertainty. To do so, we propose that each agent takes decisions in face of the worst-case behavior contained in an ambiguity set of tunable size, centered at the emergent behavior so implicitly defined. This gives rise to a novel equilibrium notion, which we call strategically robust equilibrium. Building on its definition, we show that, when judiciously operationalized via optimal transport, strategically robust equilibria (i) are guaranteed to exist under the same assumptions required for Nash equilibria; (ii) interpolate between Nash and security strategies; (iii) come at no additional computational cost compared to Nash equilibria. Through a variety of experiments, including bi-matrix games, congestion games, and Cournot competition, we show that strategic robustness protects against uncertainty in the opponents' behavior and, surprisingly, often results in higher equilibrium payoffs - an effect we refer to as coordination via robustification.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Data-Driven Games with Coherent Risk Measures

    cs.GT 2026-05 unverdicted novelty 7.0 of 10

    Distributionally robust games with coherent risk measures admit equilibria in data-driven settings, are continuous rather than finite, have PPAD-complete computation in general, and admit multilinear complementarity f...

  2. Beyond Bayesian Nash: Learning Minimax-Regret Equilibria for Adversarial Team Games under Asymmetric Information

    cs.GT 2026-07 conditional novelty 6.5 of 10

    PR-MRE hedges regret over high-confidence type subsets and, via PRMRE-PSRO, yields more distribution-shift-robust team policies than BNE on graph Capture-the-Flag.

Reference graph

Works this paper leans on

82 extracted references · 77 canonical work pages · cited by 2 Pith papers

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution isbn issn journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in "" FUNCTION format.date year ...

  3. [3]

    Mathematical programming 107(1-2):231--273

    Aghassi M, Bertsimas D (2006) Robust game theory. Mathematical programming 107(1-2):231--273

    work page 2006

  4. [4]

    Aliprantis CD, Border KC (2006) Infinite Dimensional Analysis A Hitchhiker's Guide 3rd Edition (Springer Berlin), 3 edition

    work page 2006

  5. [5]

    Ambrosio L, Gigli N, Savar \'e G (2005) Gradient flows: in metric spaces and in the space of probability measures (Springer Science & Business Media)

    work page 2005

  6. [6]

    screening

    Bagchi A, Paul JA (2014) Optimal allocation of resources in airport security: Profiling vs. screening. Operations Research 62(2):219--233

    work page 2014

  7. [7]

    Operations Research 72(1):355--372

    Balseiro SR, Besbes O, Castro F (2024) Mechanism design under approximate incentive compatibility. Operations Research 72(1):355--372

    work page 2024

  8. [8]

    Games and Economic Behavior 4(1):18--36

    Beja A (1992) Imperfect equilibrium. Games and Economic Behavior 4(1):18--36

    work page 1992

Show all 82 references
  1. [9]

    Bertsekas DP, Shreve SE (1996) Stochastic Optimal Control: The Discrete-Time Case, volume 5 (Athena Scientific)

    1996

  2. [10]

    Journal of Economic Theory 183:786--822

    Bich P (2019) Strategic uncertainty and equilibrium selection in discontinuous games. Journal of Economic Theory 183:786--822

    2019

  3. [11]

    Mathematics of Operations Research 44(2):565--600

    Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Mathematics of Operations Research 44(2):565--600

    2019

  4. [12]

    Boyd SP, Vandenberghe L (2004) Convex optimization (Cambridge university press)

    2004

  5. [13]

    American Economic Review 104(3):898--930

    Bramoull \'e Y, Kranton R, D'Amours M (2014) Strategic interaction and networks. American Economic Review 104(3):898--930

    2014

  6. [14]

    Models, methods, and applications for innovative decision making 200--233

    Cachon GP, Netessine S (2006) Game theory in supply chain analysis. Models, methods, and applications for innovative decision making 200--233

    2006

  7. [15]

    Camerer CF (2011) Behavioral game theory: Experiments in strategic interaction (Princeton university press)

    2011

  8. [16]

    The Quarterly Journal of Economics 119(3):861--898

    Camerer CF, Ho TH, Chong JK (2004) A cognitive hierarchy model of games. The Quarterly Journal of Economics 119(3):861--898

    2004

  9. [17]

    Operations Research 57(6):1421--1437

    Cominetti R, Correa JR, Stier-Moses NE (2009) The impact of oligopolistic competition in networks. Operations Research 57(6):1421--1437

    2009

  10. [18]

    Hachette)

    Cournot AA (1838) Recherches sur les principes math \'e matiques de la th \'e orie des richesses (L. Hachette)

  11. [19]

    Decisions in economics and finance 40(1-2):177--198

    Crespi GP, Radi D, Rocca M (2017) Robust games: theory and application to a cournot duopoly model. Decisions in economics and finance 40(1-2):177--198

    2017

  12. [20]

    Computational Economics 65(2):717--761

    Crespi GP, Radi D, Rocca M (2025) Insights on the theory of robust games. Computational Economics 65(2):717--761

    2025

  13. [21]

    Communications of the ACM 52(2):89--97

    Daskalakis C, Goldberg PW, Papadimitriou CH (2009) The complexity of computing a N ash equilibrium. Communications of the ACM 52(2):89--97

    2009

  14. [22]

    Journal of Economic Theory 64(2):305--324

    Dow J, Werlang SRdC (1994) Nash equilibrium under knightian uncertainty: breaking down backward induction. Journal of Economic Theory 64(2):305--324

    1994

  15. [23]

    Drew F, Jean T (1991) Game Theory (MIT Press)

    1991

  16. [24]

    Mathematical Programming 3(1):1--22

    Eaves BC (1972) Homotopies for computation of fixed points. Mathematical Programming 3(1):1--22

    1972

  17. [25]

    Econometrica 84(3):1093--1130

    Esponda I, Pouzo D (2016) Berk-- N ash equilibrium: A framework for modeling agents with misspecified models. Econometrica 84(3):1093--1130

    2016

  18. [26]

    Mathematical programming 85(1):107

    Facchinei F, Jiang H, Qi L (1999) A smoothing method for mathematical programs with equilibrium constraints. Mathematical programming 85(1):107

    1999

  19. [27]

    Convex optimization in signal processing and communications 443

    Facchinei F, Pang JS (2010) 12 nash equilibria: the variational approach. Convex optimization in signal processing and communications 443

    2010

  20. [28]

    Journal of the ACM 70(1):1--74

    Fearnley J, Goldberg P, Hollender A, Savani R (2022) The complexity of gradient descent: CLS = PPAD PLS . Journal of the ACM 70(1):1--74

    2022

  21. [29]

    Computational Optimization and Applications 12:207--227

    Ferris MC, Munson TS (1999) Interfaces to path 3.0: Design, implementation and usage. Computational Optimization and Applications 12:207--227

    1999

  22. [30]

    Fudenberg D (1991) Game theory (MIT press)

    1991

  23. [31]

    Econometrica: Journal of the Econometric Society 523--545

    Fudenberg D, Levine DK (1993) Self-confirming equilibrium. Econometrica: Journal of the Econometric Society 523--545

    1993

  24. [32]

    Operations Research 72(3):966--982

    Gairing M, Paccagnan D (2023) In congestion games, taxes achieve optimal approximation. Operations Research 72(3):966--982

    2023

  25. [33]

    2023 62nd IEEE Conference on Decision and Control (CDC), 5230--5236 (IEEE)

    Ganzfried S (2023) Safe equilibrium. 2023 62nd IEEE Conference on Decision and Control (CDC), 5230--5236 (IEEE)

    2023

  26. [34]

    Operations Research 72(3):1177--1191

    Gao R, Chen X, Kleywegt AJ (2024) Wasserstein distributionally robust optimization and variation regularization. Operations Research 72(3):1177--1191

    2024

  27. [35]

    Mathematics of Operations Research 48(2):603--655

    Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with wasserstein distance. Mathematics of Operations Research 48(2):603--655

    2023

  28. [36]

    Journal of mathematical economics 18(2):141--153

    Gilboa I, Schmeidler D (1989) Maxmin expected utility with non-unique prior. Journal of mathematical economics 18(2):141--153

    1989

  29. [37]

    Proceedings of the American Mathematical Society 3(1):170--174

    Glicksberg IL (1952) A further generalization of the kakutani fixed theorem, with application to nash equilibrium points. Proceedings of the American Mathematical Society 3(1):170--174

    1952

  30. [38]

    Management science 57(3):566--581

    Ha AY, Tong S, Zhang H (2011) Sharing demand information in competing supply chains with production diseconomies. Management science 57(3):566--581

    2011

  31. [39]

    Operations Research 73(1):209--238

    Han Y, Weissman T, Zhou Z (2025) Optimal no-regret learning in repeated first-price auctions. Operations Research 73(1):209--238

    2025

  32. [40]

    bayesian

    Harsanyi JC (1967) Games with incomplete information played by "bayesian" players, I-III. Part I. the basic model. Management Science 14:159--182

    1967

  33. [41]

    bayesian

    Harsanyi JC (1968) Games with incomplete information played by "bayesian" players, i-iii. part ii. bayesian equilibrium points. Management Science 14:320--334

    1968

  34. [42]

    Operations Research 55(1):113--127

    Hobbs BF, Pang JS (2007) Nash-cournot equilibria in electric power markets with piecewise linear demand functions and joint constraints. Operations Research 55(1):113--127

    2007

  35. [43]

    Proceedings of the Third Conference on Uncertainty in Artificial Intelligence, 429–447, UAI'87 (Arlington, Virginia, USA: AUAI Press)

    Horvitz EJ (1987) Reasoning about beliefs and actions under computational resource constraints. Proceedings of the Third Conference on Uncertainty in Artificial Intelligence, 429–447, UAI'87 (Arlington, Virginia, USA: AUAI Press)

    1987

  36. [44]

    Management Science 18(5-part-1):312--318

    Howson Jr JT (1972) Equilibria of polymatrix games. Management Science 18(5-part-1):312--318

    1972

  37. [45]

    Handbook of the fundamentals of financial decision making: Part I, 99--127 (World Scientific)

    Kahneman D, Tversky A (2013) Prospect theory: An analysis of decision under risk. Handbook of the fundamentals of financial decision making: Part I, 99--127 (World Scientific)

    2013

  38. [46]

    Econometrica: Journal of the Econometric Society 1003--1037

    Kohlberg E, Mertens JF (1986) On the strategic stability of equilibria. Econometrica: Journal of the Econometric Society 1003--1037

    1986

  39. [47]

    Annual symposium on theoretical aspects of computer science, 404--413 (Springer)

    Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. Annual symposium on theoretical aspects of computer science, 404--413 (Springer)

    1999

  40. [48]

    Operations research & management science in the age of analytics, 130--166 (INFORMS)

    Kuhn D, Esfahani PM, Nguyen VA, Shafieezadeh-Abadeh S (2019) Wasserstein distributionally robust optimization: Theory and applications in machine learning. Operations research & management science in the age of analytics, 130--166 (INFORMS)

    2019

  41. [49]

    Acta Numerica 34:579--804

    Kuhn D, Shafiee S, Wiesemann W (2025) Distributionally robust optimization. Acta Numerica 34:579--804

    2025

  42. [50]

    European Journal of Operational Research 265(2):631--643

    Liu Y, Xu H, Yang SJS, Zhang J (2018) Distributionally robust equilibrium for continuous games: Nash and stackelberg models. European Journal of Operational Research 265(2):631--643

    2018

  43. [51]

    arXiv preprint arXiv:1512.03253

    Loizou N (2015) Distributionally robust game theory. arXiv preprint arXiv:1512.03253

    2015 arXiv

  44. [52]

    Luo ZQ, Pang JS, Ralph D (1996) Mathematical programs with equilibrium constraints (Cambridge University Press)

    1996

  45. [53]

    IEEE Transactions on control systems technology 21(1):67--78

    Ma Z, Callaway DS, Hiskens IA (2011) Decentralized charging control of large populations of plug-in electric vehicles. IEEE Transactions on control systems technology 21(1):67--78

    2011

  46. [54]

    Games and Economic Behavior 31(2):191--219

    Marinacci M (2000) Ambiguous games. Games and Economic Behavior 31(2):191--219

    2000

  47. [55]

    The Thirteenth International Conference on Learning Representations

    Mazumdar E, Panaganti K, Shi L (2025) Tractable multi-agent reinforcement learning through behavioral economics. The Thirteenth International Conference on Learning Representations

    2025

  48. [56]

    Games and economic behavior 10(1):6--38

    McKelvey RD, Palfrey TR (1995) Quantal response equilibria for normal form games. Games and economic behavior 10(1):6--38

    1995

  49. [57]

    Mathematical Programming 171(1-2):115--166

    Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the W asserstein metric: performance guarantees and tractable reformulations. Mathematical Programming 171(1-2):115--166

    2018

  50. [58]

    International journal of game theory 7:73--80

    Myerson RB (1978) Refinements of the nash equilibrium concept. International journal of game theory 7:73--80

    1978

  51. [59]

    Annals of Mathematics 54:286--295

    Nash J (1951) Non-cooperative games. Annals of Mathematics 54:286--295

    1951

  52. [60]

    Management Science 51(5):813--831

    Netessine S, Shumsky RA (2005) Revenue management games: Horizontal and vertical competition. Management Science 51(5):813--831

    2005

  53. [61]

    Journal of Economic Theory 38(2):238--260

    Osborne MJ, Pitchik C (1986) Price competition in a capacity-constrained duopoly. Journal of Economic Theory 38(2):238--260

    1986

  54. [62]

    IEEE Transactions on Automatic Control 64(4):1373--1388

    Paccagnan D, Gentile B, Parise F, Kamgarpour M, Lygeros J (2018) Nash and W ardrop equilibria in aggregative games with coupling constraints. IEEE Transactions on Automatic Control 64(4):1373--1388

    2018

  55. [63]

    Proceedings of the 24th ACM Conference on Economics and Computation, 1045, EC '23 (New York, NY, USA: Association for Computing Machinery)

    Papadimitriou C, Vlatakis-Gkaragkounis EV, Zampetakis M (2023) The computational complexity of multi-player concave games and kakutani fixed points. Proceedings of the 24th ACM Conference on Economics and Computation, 1045, EC '23 (New York, NY, USA: Association for Computing ...

    2023

  56. [64]

    Algorithmic Learning Theory, 725--751 (PMLR)

    Perchet V (2020) Finding robust nash equilibria. Algorithmic Learning Theory, 725--751 (PMLR)

    2020

  57. [65]

    Journal of Intelligent & Fuzzy Systems 33(5):2749--2762

    Qu S, Meng D, Zhou Y, Dai Y (2017) Distributionally robust games with an application to supply chain. Journal of Intelligent & Fuzzy Systems 33(5):2749--2762

    2017

  58. [66]

    Journal of Economic Theory 145(1):264--286

    Renou L, Schlag KH (2010) Minimax regret and strategic uncertainty. Journal of Economic Theory 145(1):264--286

    2010

  59. [67]

    Econometrica: Journal of the Econometric Society 520--534

    Rosen JB (1965) Existence and uniqueness of equilibrium points for concave n-person games. Econometrica: Journal of the Econometric Society 520--534

    1965

  60. [68]

    International Journal of Game Theory 18:273--292

    Rosenthal RW (1989) A bounded-rationality approach to the study of noncooperative games. International Journal of Game Theory 18:273--292

    1989

  61. [69]

    Communications of the ACM 53(7):78--86

    Roughgarden T (2010) Algorithmic game theory. Communications of the ACM 53(7):78--86

    2010

  62. [70]

    Birk \"a user, NY 55(58-63):94

    Santambrogio F (2015) Optimal transport for applied mathematicians. Birk \"a user, NY 55(58-63):94

    2015

  63. [71]

    Journal of Game Theory' 4:25--55

    Selten R (1975) Reexamination of the perfectness concept for equilibrium points in extensive games. Journal of Game Theory' 4:25--55

    1975

  64. [72]

    Journal of Machine Learning Research 20(103):1--68

    Shafieezadeh-Abadeh S, Kuhn D, Esfahani PM (2019) Regularization via mass transportation. Journal of Machine Learning Research 20(103):1--68

    2019

  65. [73]

    Operations Research 31(2):253--276

    Sherali HD, Soyster AL, Murphy FH (1983) Stackelberg-nash-cournot equilibria: characterizations and computations. Operations Research 31(2):253--276

    1983

  66. [74]

    Games and Economic Behavior 10:218--254

    Stahl DO, Wilson PW (1995) On players' models of other players: Theory and experimental evidence. Games and Economic Behavior 10:218--254

    1995

  67. [75]

    Number 97 (American Mathematical Soc.)

    Sturmfels B (2002) Solving systems of polynomial equations. Number 97 (American Mathematical Soc.)

    2002

  68. [76]

    European Journal of Operational Research 181(1):305--314

    Sun LJ, Gao ZY (2007) An equilibrium model for urban transit assignment based on game theory. European Journal of Operational Research 181(1):305--314

    2007

  69. [77]

    Sundaram RK (1996) A First Course in Optimization Theory (Cambridge University Press)

    1996

  70. [78]

    Mathematics of Operations Research 12(3):377--397

    van der Laan G, Talman A, Van der Heyden L (1987) Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling. Mathematics of Operations Research 12(3):377--397

    1987

  71. [79]

    Villani C (2009) Optimal transport: old and new, volume 338 (Springer)

    2009

  72. [80]

    Von Neumann J, Morgenstern O (1947) Theory of games and economic behavior

    1947

  73. [81]

    arXiv preprint arXiv:2002.08414

    Yekkehkhany A, Murray T, Nagi R (2020) Risk-averse equilibrium for games. arXiv preprint arXiv:2002.08414

    2020 arXiv

  74. [82]

    Operations Research 73(2):862--878

    Zhen J, Kuhn D, Wiesemann W (2025) A unified theory of robust and distributionally robust optimization via the primal-worst-equals-dual-best principle. Operations Research 73(2):862--878

    2025

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.