Cover Image

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rothe, Jörg, Schlotter, Ildikó
Format:	Preprint
Published:	2025
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

Necessary President in Elections with Parties
by: Cechlárová, Katarína, et al.
Published: (2026)

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

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)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
by: Hanaka, Tesshu, et al.
Published: (2024)

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

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
by: Horn, Laryssa, et al.
Published: (2025)

Hedonic Seat Arrangement Problems
by: Bodlaender, Hans L., et al.
Published: (2020)

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

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

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

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

Stability in Random Hedonic Games
by: Bullinger, Martin, et al.
Published: (2024)

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

$\varepsilon$-fractional Core Stability in Hedonic Games
by: Fioravanti, Simone, et al.
Published: (2023)

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

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)

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

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
by: Hansen, Kristoffer Arnsfelt, 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)

Quantifying Core Stability Relaxations in Hedonic Games
by: Demeulemeester, Tom, et al.
Published: (2024)

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

Control by Deleting Players from Weighted Voting Games Is NP^PP-Complete for the Penrose-Banzhaf Power Index
by: Kaczmarek, Joanna, et al.
Published: (2025)

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

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

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Core-Stable Kidney Exchange via Altruistic Donors
by: Csáji, Gergely, et al.
Published: (2026)

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

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

Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
by: Hanaka, Tesshu, et al.
Published: (2026)

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

Equilibrium and Selfish Behavior in Network Contagion
by: Zhang, Yi, et al.
Published: (2025)

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

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
by: Chen, Xi, et al.
Published: (2025)

Reducing the complexity of computing the values of a Nash equilibrium
by: Chatterjee, Debtoru, et al.
Published: (2025)

Tarski Lower Bounds from Multi-Dimensional Herringbones
by: Brânzei, Simina, et al.
Published: (2025)

On Minimal Achievable Quotas in Multiwinner Voting
by: Becker, Patrick, et al.
Published: (2025)

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)

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