Cover Image

The Complexity of Symmetric Bimatrix Games with Common Payoffs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghosh, Abheek, Hollender, Alexandros
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Sparse Win-Lose Bimatrix Games
by: Batziou, Eleni, et al.
Published: (2026)

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

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

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

Persuading a Credible Agent
by: Gan, Jiarui, et al.
Published: (2024)

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)

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

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)

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

The Complexity of Two-Team Polymatrix Games with Independent Adversaries
by: Hollender, Alexandros, et al.
Published: (2024)

Modelling Network Resilience: The Complexity of Some Graph Division Games
by: Gutowski, Grzegorz, et al.
Published: (2026)

On Altruism and Spite in Bimatrix Games
by: Fasoulakis, Michail, et al.
Published: (2025)

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

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

Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)

Vector Cost Bimatrix Games with Applications to Autonomous Racing
by: Toaz, Benjamin R., et al.
Published: (2025)

The Computational Complexity of the Housing Market
by: Lock, Edwin, et al.
Published: (2024)

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

The Complexity of Stackelberg Pricing Games
by: Grüne, Christoph, et al.
Published: (2025)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
by: Rothe, Jörg, et al.
Published: (2025)

On the Smoothed Complexity of Combinatorial Local Search
by: Giannakopoulos, Yiannis, et al.
Published: (2022)

The Complexity of Min-Max Optimization with Product Constraints
by: Bernasconi, Martino, et al.
Published: (2026)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
by: Bredereck, Robert, et al.
Published: (2024)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
by: Aziz, Haris, et al.
Published: (2024)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
by: Kaczmarek, Joanna, et al.
Published: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
by: Brânzei, Simina, et al.
Published: (2024)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
by: Lin, Chuang-Chieh, et al.
Published: (2023)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
by: Cheval, Vincent, et al.
Published: (2025)

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
by: Koenemann, Jochen, et al.
Published: (2021)

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

Complexity of Round-Robin Allocation with Potentially Noisy Queries
by: Li, Zihan, et al.
Published: (2024)

Fair Interventions in Weighted Congestion Games
by: Fischer, Miriam, et al.
Published: (2023)

Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
by: Allamigeon, Xavier, et al.
Published: (2022)

Stochastic Window Mean-Payoff Games
by: Doyen, Laurent, et al.
Published: (2023)

Complexity of Stability in Trading Networks
by: Fleiner, Tamás, et al.
Published: (2018)