Cover Image

Envy-freeness in 3D Hedonic Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	McKay, Michael, Cseh, Ágnes, Manlove, David
Format:	Preprint
Published:	2022
Subjects:	Computer Science and Game Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deviation Dynamics in Cardinal Hedonic Games
by: Zech, Valentin, et al.
Published: (2025)

Welfare Approximation in Additively Separable Hedonic Games
by: Bullinger, Martin, et al.
Published: (2025)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
by: Glitzner, Frederik, et al.
Published: (2024)

Stable Matching with Deviators and Conformists
by: Glitzner, Frederik, et al.
Published: (2026)

A Minimax Perspective on Almost-Stable Matchings
by: Glitzner, Frederik, et al.
Published: (2026)

Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
by: Glitzner, Frederik, et al.
Published: (2025)

MATWA: A Web Toolkit for Matching under Preferences
by: Glitzner, Frederik, et al.
Published: (2024)

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

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
by: Bullinger, Martin, et al.
Published: (2025)

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

On Interim Envy-Free Allocation Lotteries
by: Caragiannis, Ioannis, et al.
Published: (2021)

Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)

Envy-Free School Redistricting Between Two Groups
by: Shibatani, Daisuke, et al.
Published: (2026)

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
by: Halpern, Daniel, et al.
Published: (2025)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
by: Inamdar, Tanmay, et al.
Published: (2026)

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
by: S, Ajaykrishnan E, et al.
Published: (2025)

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

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
by: Csáji, Gergely, et al.
Published: (2023)

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

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
by: Bilò, Vittorio, et al.
Published: (2025)

Lipschitz Continuous Allocations for Optimization Games
by: Kumabe, Soh, et al.
Published: (2024)

Individual Rationality in Topological Distance Games is Surprisingly Hard
by: Deligkas, Argyrios, et al.
Published: (2024)

The NTU Partitioned Matching Game for International Kidney Exchange Programs
by: Csáji, Gergely, et al.
Published: (2024)

Computing Power Indices in Weighted Majority Games with Formal Power Series
by: Kakimura, Naonori, et al.
Published: (2025)

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

Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)

Combinatorial Stationary Prophet Inequalities
by: Patel, Neel, et al.
Published: (2023)

Nemesis, an Escape Game in Graphs
by: Bergé, Pierre, et al.
Published: (2026)

Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach
by: Livanos, Vasilis, et al.
Published: (2024)

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

The Average-Value Allocation Problem
by: Bhawalkar, Kshipra, et al.
Published: (2024)

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

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

Solving Matrix Games with Near-Optimal Matvec Complexity
by: Karmarkar, Ishani, et al.
Published: (2026)

Public Goods Games in Directed Networks with Constraints on Sharing
by: Deligkas, Argyrios, et al.
Published: (2025)

Edge-weighted Online Stochastic Matching: Beating $1-\frac1e$
by: Yan, Shuyi
Published: (2022)

Online Resource Allocation with Cancellations
by: Ekbatani, Farbod, et al.
Published: (2022)

Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)

Approximating Nash Social Welfare by Matching and Local Search
by: Garg, Jugal, et al.
Published: (2022)