Imagen de Portada

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dong, Jing, Wang, Baoxiang, Yu, Yaoliang
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Last-iterate Convergence in Regularized Graphon Mean Field Game
por: Dong, Jing, et al.
Publicado: (2024)

Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback
por: Dong, Jing, et al.
Publicado: (2024)

On the Decomposition of Differential Game
por: Zhou, Nanxiang, et al.
Publicado: (2024)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
por: Wang, Guillaume, et al.
Publicado: (2022)

The Representation-Rationalizability Tradeoff in Reward Learning
por: Dong, Jing, et al.
Publicado: (2026)

Pointwise Convergence in Games with Conflicting Interest
por: Zhou, Nanxiang, et al.
Publicado: (2025)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
por: Leonardos, Stefanos, et al.
Publicado: (2021)

Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics
por: Jordan, Philip, et al.
Publicado: (2026)

Data Poisoning to Fake a Nash Equilibrium in Markov Games
por: Wu, Young, et al.
Publicado: (2023)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
por: Liu, Junyan, et al.
Publicado: (2026)

Strategizing against No-regret Learners
por: Deng, Yuan, et al.
Publicado: (2019)

Mixed Strategy Nash Equilibrium for Crowd Navigation
por: Sun, Max Muchen, et al.
Publicado: (2024)

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

Provable Policy Gradient Methods for Average-Reward Markov Potential Games
por: Cheng, Min, et al.
Publicado: (2024)

Tractable Equilibrium Computation in Markov Games through Risk Aversion
por: Mazumdar, Eric, et al.
Publicado: (2024)

Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
por: Qi, Ju, et al.
Publicado: (2023)

Large-Scale Auto-bidding with Nash Equilibrium Constraints
por: Mou, Zhiyu, et al.
Publicado: (2025)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
por: Sychrovský, David, et al.
Publicado: (2025)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
por: Barakat, Anas, et al.
Publicado: (2026)

Independent Learning in Constrained Markov Potential Games
por: Jordan, Philip, et al.
Publicado: (2024)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
por: Erez, Liad, et al.
Publicado: (2022)

Privacy Guarantee for Nash Equilibrium Computation of Aggregative Games Based on Pointwise Maximal Leakage
por: Cheng, Zhaoyang, et al.
Publicado: (2025)

Nash Equilibrium Between Consumer Electronic Devices and DoS Attacker for Distributed IoT-enabled RSE Systems
por: Chen, Gengcan, et al.
Publicado: (2025)

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

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

Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games
por: Zaman, Muhammad Aneeq uz, et al.
Publicado: (2024)

Gradient Manipulation in Distributed Stochastic Gradient Descent with Strategic Agents: Truthful Incentives with Convergence Guarantees
por: Chen, Ziqin, et al.
Publicado: (2026)

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

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
por: Fujii, Kaito
Publicado: (2023)

Nash CoT: Multi-Path Inference with Preference Equilibrium
por: Zhang, Ziqi, et al.
Publicado: (2024)

Nash Equilibrium in Games on Graphs with Incomplete Preferences
por: Kulkarni, Abhishek N., et al.
Publicado: (2024)

Scale-Invariant Fast Convergence in Games
por: Tsuchiya, Taira, et al.
Publicado: (2026)

Playing Markov Games Without Observing Payoffs
por: Ablin, Daniel, et al.
Publicado: (2025)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
por: Lei, Qi, et al.
Publicado: (2020)

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
por: Yu, Eason, et al.
Publicado: (2025)

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

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
por: Maiti, Arnab, et al.
Publicado: (2023)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
por: Feng, Songtao, et al.
Publicado: (2023)

Paths to Equilibrium in Games
por: Yongacoglu, Bora, et al.
Publicado: (2024)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
por: Komiyama, Junpei, et al.
Publicado: (2025)