Cover Image

Robust equilibria in continuous games: From strategic to dynamic robustness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lotidis, Kyriakos, Mertikopoulos, Panayotis, Bambos, Nicholas, Blanchet, Jose
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning Optimization and Control Primary 91A10, 91A26, secondary 68Q32, 68T05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerated regularized learning in finite N-person games
by: Lotidis, Kyriakos, et al.
Published: (2024)

Multi-agent learning under uncertainty: Recurrence vs. concentration
by: Lotidis, Kyriakos, et al.
Published: (2025)

A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
by: Legacci, Davide, et al.
Published: (2024)

No-regret learning in harmonic games: Extrapolation in the face of conflicting interests
by: Legacci, Davide, et al.
Published: (2024)

Nested replicator dynamics, nested logit choice, and similarity-based learning
by: Mertikopoulos, Panayotis, et al.
Published: (2024)

A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games
by: Vasconcelos, Francisca, et al.
Published: (2023)

On the discrete-time origins of the replicator dynamics: From convergence to instability and chaos
by: Falniowski, Fryderyk, et al.
Published: (2024)

Breaking $1/ε$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
by: Su, Yiheng, et al.
Published: (2025)

A Parallelizable Approach for Characterizing NE in Zero-Sum Games After a Linear Number of Iterations of Gradient Descent
by: Kim, Taemin, et al.
Published: (2025)

On the equivalence of semidefinite programming and zero-sum semidefinite games
by: Elliott, Jesse, et al.
Published: (2026)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
by: Azizian, Waïss, et al.
Published: (2022)

Computing Game Symmetries and Equilibria That Respect Them
by: Tewolde, Emanuel, et al.
Published: (2025)

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
by: Ito, Shinji, et al.
Published: (2026)

Two-player Domino games
by: de Menibus, Benjamin Hellouin, et al.
Published: (2023)

The Value of Recall in Extensive-Form Games
by: Berker, Ratip Emin, et al.
Published: (2024)

Logit-Q Dynamics for Efficient Learning in Stochastic Teams
by: Donmez, Ahmed Said, et al.
Published: (2023)

Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
by: Tewolde, Emanuel, et al.
Published: (2024)

Semidefinite network games: multiplayer minimax and complementarity problems
by: Ickstadt, Constantin, et al.
Published: (2023)

Tamed Langevin sampling under weaker conditions
by: Lytras, Iosif, et al.
Published: (2024)

Decision Making under Imperfect Recall: Algorithms and Benchmarks
by: Tewolde, Emanuel, et al.
Published: (2026)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
by: Azizian, Waïss, et al.
Published: (2025)

Initialization-driven neural generation and training for high-dimensional optimal control and first-order mean field games
by: Assouli, Mouhcine, et al.
Published: (2025)

Algorithmic Cheap Talk
by: Babichenko, Yakov, et al.
Published: (2023)

A Characterization of Complexity in Public Goods Games
by: Gilboa, Matan
Published: (2023)

The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
by: Schlotter, Ildikó, et al.
Published: (2021)

Fair Division in a Variable Setting
by: Chandramouleeswaran, Harish, et al.
Published: (2024)

The impact of uncertainty on regularized learning in games
by: Cauvin, Pierre-Louis, et al.
Published: (2025)

An Equilibrium Model for Schedule-Based Transit Networks with Hard Vehicle Capacities
by: Harks, Tobias, et al.
Published: (2024)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
by: Azizian, Waïss, et al.
Published: (2024)

Closed-loop equilibria for Stackelberg games: a story about stochastic targets
by: Hernández, Camilo, et al.
Published: (2024)

Improved Approximation Ratio for Strategyproof Facility Location on a Cycle
by: Rogowski, Krzysztof, et al.
Published: (2025)

TEE-BFT: Pricing the Security of Data Center Execution Assurance
by: Shamis, Alex, et al.
Published: (2025)

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
by: Bhaskar, Umang, et al.
Published: (2024)

Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
by: Jimbo, Takumi, et al.
Published: (2026)

On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-
by: Yamazaki, Shunta, et al.
Published: (2025)

Carbon Pricing in Traffic Networks
by: Griesbach, Svenja M., et al.
Published: (2025)

A Linear Programming Approach to Estimate the Core in Cooperative Games
by: Camacho, J, et al.
Published: (2025)

On marginal feature attributions of tree-based models
by: Filom, Khashayar, et al.
Published: (2023)

Markets are competitive if and only if P != NP
by: Maymin, Philip Z.
Published: (2026)