Copertina

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Guillaume, Chizat, Lénaïc
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control Computer Science and Game Theory Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
di: Ding, Shihong, et al.
Pubblicazione: (2023)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
di: Sharma, Vedansh
Pubblicazione: (2025)

Branch-and-Cut for Mixed-Integer Nash Equilibrium Problems
di: Duguet, Aloïs, et al.
Pubblicazione: (2025)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
di: Cai, Yang, et al.
Pubblicazione: (2023)

Convergence of Regret Matching in Potential Games and Constrained Optimization
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2025)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
di: Cai, Yang, et al.
Pubblicazione: (2024)

Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games
di: Yorulmaz, Asrin Efe, et al.
Pubblicazione: (2025)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
di: Cai, Yang, et al.
Pubblicazione: (2024)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
di: Daskalakis, Constantinos, et al.
Pubblicazione: (2018)

Approximating Competitive Equilibrium by Nash Welfare
di: Garg, Jugal, et al.
Pubblicazione: (2024)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
di: Cai, Yang, et al.
Pubblicazione: (2025)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
di: Cai, Yang, et al.
Pubblicazione: (2025)

Branch-and-Cut for Computing Approximate Equilibria of Mixed-Integer Generalized Nash Games
di: Duguet, Aloïs, et al.
Pubblicazione: (2025)

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
di: Graf, Lukas, et al.
Pubblicazione: (2021)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
di: Cai, Yang, et al.
Pubblicazione: (2024)

Personalized incentives as feedback design in generalized Nash equilibrium problems
di: Fabiani, Filippo, et al.
Pubblicazione: (2022)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
di: Dong, Jing, et al.
Pubblicazione: (2024)

Deviation Between Team-Optimal Solution and Nash Equilibrium in Flow Assignment Problems
di: Xu, Gehui, et al.
Pubblicazione: (2025)

Decentralized Multi-product Pricing: Diagonal Dominance, Nash Equilibrium, and Price of Anarchy
di: Chen, Boxiao, et al.
Pubblicazione: (2026)

Linear Convergence in Games with Delayed Feedback via Extra Prediction
di: Fujimoto, Yuma, et al.
Pubblicazione: (2026)

Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
di: Chizat, Lénaïc
Pubblicazione: (2024)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
di: Emmanouilidis, Konstantinos, et al.
Pubblicazione: (2024)

The Oracle Complexity of Simplex-based Matrix Games
di: Kornowski, Guy, et al.
Pubblicazione: (2024)

Optimistic Online Learning in Symmetric Cone Games
di: Barakat, Anas, et al.
Pubblicazione: (2025)

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
di: Olver, Neil, et al.
Pubblicazione: (2024)

Operator Splitting for Learning to Predict Equilibria in Convex Games
di: McKenzie, Daniel, et al.
Pubblicazione: (2021)

Distributionally Robust Nash Equilibrium Seeking with Partial Observations and Distributed Communication
di: Mandal, Nirabhra, et al.
Pubblicazione: (2026)

Non-Normalized Solutions of Generalized Nash Equilibrium in Autonomous Racing
di: Pustilnik, Mark, et al.
Pubblicazione: (2025)

Reinforcement Learning for Finite Space Mean-Field Type Games
di: Shao, Kai, et al.
Pubblicazione: (2024)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
di: Yongacoglu, Bora, et al.
Pubblicazione: (2021)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
di: Soleymani, Ashkan, et al.
Pubblicazione: (2025)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
di: Faizal, Fathima Zarin, et al.
Pubblicazione: (2024)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
di: Nayak, Anupam, et al.
Pubblicazione: (2025)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
di: Sakos, Iosif, et al.
Pubblicazione: (2023)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
di: Ba, Wenjia, et al.
Pubblicazione: (2021)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
di: Soleymani, Ashkan, et al.
Pubblicazione: (2025)

Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting
di: Gao, Bolin, et al.
Pubblicazione: (2021)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
di: Huang, Han, et al.
Pubblicazione: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
di: Hu, Ruimeng, et al.
Pubblicazione: (2025)

On Approximate Nash Equilibria in Mean Field Games
di: Djete, Mao Fabrice, et al.
Pubblicazione: (2026)