:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cechlárová, Katarína, Schlotter, Ildikó
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	https://arxiv.org/abs/2602.10601
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Candidate nomination for Condorcet-consistent voting rules
by: Schlotter, Ildikó, et al.
Published: (2025)

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

Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
by: Cechlárová, Katarína, et al.
Published: (2026)

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

Computing Equilibrium Nominations in Presidential Elections
by: Faliszewski, Piotr, et al.
Published: (2025)

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
by: Chen, Jiehua, et al.
Published: (2025)

Identifying Imperfect Clones in Elections
by: Faliszewski, Piotr, et al.
Published: (2025)

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

Parameterized Algorithms for Optimal Refugee Resettlement
by: Chen, Jiehua, et al.
Published: (2024)

The Strong Core of Housing Markets with Partial Order Preferences
by: Schlotter, Ildikó, et al.
Published: (2025)

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

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

The Complexity of Strategic Behavior in Primary Elections
by: Cleveland, Colin, et al.
Published: (2026)

Stable Hypergraph Matching in Unimodular Hypergraphs
by: Biró, Péter, et al.
Published: (2025)

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

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

Bribery's Influence on Ranked Aggregation
by: Jain, Pallavi, 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)

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

Minimizing the Cost of EFx Allocations
by: Deltl, Eva
Published: (2026)

Hardness of Approximate Hylland-Zeckhauser Equilibria
by: Braverman, Mark, et al.
Published: (2026)

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

How to Resolve Envy by Adding Goods
by: Bentert, Matthias, et al.
Published: (2025)

Smoothed analysis of deterministic discounted and mean-payoff games
by: Loff, Bruno, 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)

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

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
by: Gao, Ruiquan, 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)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
by: Horn, Laryssa, 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)

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

Spatial Voting with Incomplete Voter Information
by: Imber, Aviram, et al.
Published: (2023)

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

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
by: Babichenko, Yakov, et al.
Published: (2015)

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

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

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

Reforming an Unfair Allocation by Exchanging Goods
by: Yuen, Sheung Man, et al.
Published: (2024)

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