Cover Image

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Patris, Nikolas, Stavroulakis, Stelios, Kalogiannis, Fivos, Zhang, Rose, Panageas, Ioannis
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
by: Kalogiannis, Fivos, et al.
Published: (2024)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

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

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Nash Equilibria in Reverse Temporal Voronoi Games
by: Pawlowski, Simeon, et al.
Published: (2024)

On the Uniqueness of Nash Equilibria in Multiagent Matrix Games
by: Bailey, James P.
Published: (2024)

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

Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation
by: Jordan, Philip, et al.
Published: (2025)

Solving Zero-Sum Convex Markov Games
by: Kalogiannis, Fivos, et al.
Published: (2025)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
by: Main, James C. A.
Published: (2023)

ε-Stationary Nash Equilibria in Multi-player Stochastic Graph Games
by: Asadi, Ali, et al.
Published: (2025)

Tight Inapproximability of Nash Equilibria in Public Goods Games
by: Dinh, Jérémi Do, et al.
Published: (2024)

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
by: Kontogiannis, Andreas, et al.
Published: (2025)

The Battling Influencers Game: Nash Equilibria Structure of a Potential Game and Implications to Value Alignment
by: Wu, Young, et al.
Published: (2025)

Evolutionary Algorithms for Computing Nash Equilibria in Dynamic Games
by: Rezaee, Alireza
Published: (2025)

Computation of Nash Equilibria of Attack and Defense Games on Networks
by: Kaźmierowski, Stanisław, et al.
Published: (2023)

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

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

Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
by: Dadi, Leello, et al.
Published: (2024)

Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models
by: Panageas, Ioannis, et al.
Published: (2021)

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

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

Nash Equilibria with Derangement Degree Probabilities
by: Orzech, Edan, et al.
Published: (2026)

Randomness Requirements and Asymmetries in Nash Equilibria
by: Orzech, Edan, et al.
Published: (2023)

NashOpt - A Python Library for Computing Generalized Nash Equilibria
by: Bemporad, Alberto
Published: (2025)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games
by: Boros, Endre, et al.
Published: (2025)

Computing Equilibria in Games with Stochastic Action Sets
by: Schwarz, Thomas, et al.
Published: (2026)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2023)

On the Complexity of Learning Nash Equilibria
by: Biggar, Oliver, et al.
Published: (2026)

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

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
by: Feng, Yi, et al.
Published: (2024)

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

United We Fall: On the Nash Equilibria of Multiplex and Multilayer Network Games
by: Ebrahimi, Raman, et al.
Published: (2024)

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

Reasoning and Behavioral Equilibria in LLM-Nash Games: From Mindsets to Actions
by: Zhu, Quanyan
Published: (2025)

Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization
by: Gemp, Ian, et al.
Published: (2023)