:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hollender, Alexandros, Maystre, Gilbert, Nagarajan, Sai Ganesh
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2409.07398
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

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

Polynomial Expectation Property for Max-Polymatrix Games
by: Dai, Howard
Published: (2025)

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

Generalized Individual Q-learning for Polymatrix Games with Partial Observations
by: Donmez, Ahmed Said, et al.
Published: (2024)

Differentially Private Equilibrium Finding in Polymatrix Games
by: Liu, Mingyang, et al.
Published: (2025)

Computing approximate roots of monotone functions
by: Hollender, Alexandros, et al.
Published: (2023)

Constant Inapproximability for Fisher Markets
by: Deligkas, Argyrios, et al.
Published: (2026)

Constant Inapproximability for PPA
by: Deligkas, Argyrios, et al.
Published: (2022)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
by: Deligkas, Argyrios, et al.
Published: (2026)

Pure-Circuit: Tight Inapproximability for PPAD
by: Deligkas, Argyrios, et al.
Published: (2022)

Considering the Difference in Utility Functions of Team Players in Adversarial Team Games
by: Zhang, Youzhi
Published: (2025)

On the Computation of Equilibria in Discrete First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2024)

Equilibrium Computation in First-Price Auctions with Correlated Priors
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

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

Discrepancy Beyond Additive Functions with Applications to Fair Division
by: Hollender, Alexandros, et al.
Published: (2025)

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

Correlated vs. Uncorrelated Randomness in Adversarial Congestion Team Games
by: Orzech, Edan, et al.
Published: (2023)

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

Computing Equilibrium Points of Electrostatic Potentials
by: Ghosh, Abheek, et al.
Published: (2025)

Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)
by: Kara, Semih, et al.
Published: (2025)

Efficient Equilibrium Computation in Symmetric First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Enhanced Equilibria-Solving via Private Information Pre-Branch Structure in Adversarial Team Games
by: Qiu, Chen, et al.
Published: (2024)

Leveraging Team Correlation for Approximating Equilibrium in Two-Team Zero-Sum Games
by: Liu, Naming, et al.
Published: (2024)

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

Team-Fictitious Play for Reaching Team-Nash Equilibrium in Multi-team Games
by: Donmez, Ahmed Said, et al.
Published: (2024)

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

Diversity-seeking Jump Games in Networks
by: Narayanan, Lata, et al.
Published: (2023)

Agent-Constrained Truthful Facility Location Games
by: Deligkas, Argyrios, et al.
Published: (2024)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

Variety-Seeking Jump Games on Graphs
by: Narayanan, Lata, et al.
Published: (2025)

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
by: Dai, Yan, et al.
Published: (2024)

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization
by: Zhang, Brian Hu, et al.
Published: (2022)

Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences
by: Kanellopoulos, Panagiotis, et al.
Published: (2024)

Hedonic Diversity Games: A Complexity Picture with More than Two Colors
by: Ganian, Robert, et al.
Published: (2022)

Truthful Two-Facility Location with Candidate Locations
by: Kanellopoulos, Panagiotis, et al.
Published: (2023)

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

Mean-Field Games With Finitely Many Players: Independent Learning and Subjectivity
by: Yongacoglu, Bora, et al.
Published: (2022)

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)