:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lock, Edwin, Qiu, Zephyr, Teytelboym, Alexander
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	https://arxiv.org/abs/2402.08484
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Envy-Free House Allocation with Minimum Subsidy
by: Choo, Davin, et al.
Published: (2024)

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

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

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

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

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

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

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

Computational Social Choice: Parameterized Complexity and Challenges
by: Chen, Jiehua, et al.
Published: (2024)

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

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

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

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)

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

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

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
by: Brânzei, Simina, 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)

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

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

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

On Efficient Computation of DiRe Committees
by: Relia, Kunal
Published: (2024)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
by: Kawase, Sota, et al.
Published: (2024)

The Complexity of Optimizing Atomic Congestion
by: Brand, Cornelius, et al.
Published: (2023)

Structural Complexities of Matching Mechanisms
by: Gonczarowski, Yannai A., et al.
Published: (2022)

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

The Combinatorial Multi-Round Ascending Auction
by: Kasberger, Bernhard, et al.
Published: (2022)

Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters
by: Colley, Rachael, et al.
Published: (2025)

Smoothed analysis of deterministic discounted and mean-payoff games
by: Loff, Bruno, et al.
Published: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
by: D'Amico-Wong, Luca, et al.
Published: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
by: Zhou, Aizhong, et al.
Published: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
by: Gao, Ruiquan, et al.
Published: (2024)

Committee Elections with Candidate Attribute Constraints
by: Zhou, Aizhong, et al.
Published: (2024)

Reforming an Unfair Allocation by Exchanging Goods
by: Yuen, Sheung Man, 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)

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

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
by: Bernasconi, Martino, et al.
Published: (2024)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
by: Ron, Shiri, et al.
Published: (2024)

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