Cover Image

Cost Allocation for Set Covering: the Happy Nucleolus

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blauth, Jannis, Ellerbrock, Antonia, Traub, Vera, Vygen, Jens
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nucleolus, Happy Nucleolus, and Vehicle Routing
by: Ebert, Daniel, et al.
Published: (2025)

Nucleolus Computation by Non-Zero-Constrained Optimization
by: Ebert, Daniel, et al.
Published: (2026)

Faster Algorithms for the Least-Core value and the Nucleolus in Convex Games
by: Maggiorano, Giacomo, et al.
Published: (2025)

On the structure of EFX orientations on graphs
by: Zeng, Jinghan A, et al.
Published: (2024)

Relationship between misère NIM and two-player GOISHI HIROI
by: Abuku, Tomoaki, et al.
Published: (2024)

Edge-dominance games on graphs
by: Arthaud, Farid, et al.
Published: (2024)

An NP-hard generalization of Nim
by: Liu, Chunlei
Published: (2024)

So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)

von Neumann and Newman Pokers with Finite Decks
by: Krityakierne, Tipaluck, et al.
Published: (2024)

Misere Connect Four is Solved
by: Steele, Robert, et al.
Published: (2024)

Perpetually Fair Assignments Via Balanced Sequences of Permutations
by: Adams, Terrence, et al.
Published: (2026)

Connectedness in weighted consensus division of graphical cakes between two agents
by: Hanke, Josef, et al.
Published: (2023)

Achieving the Highest Possible Elo Rating
by: Shah, Rikhav
Published: (2022)

An upper bound for the number of chess diagrams without promotion
by: Gourion, Daniel
Published: (2021)

A few good choices
by: Nguyen, Thanh, et al.
Published: (2025)

A Linear Programming Approach to the Super-Stable Roommates Problem
by: Kamiyama, Naoyuki
Published: (2025)

Cycle Patterns and Mean Payoff Games
by: Loho, Georg, et al.
Published: (2025)

On the Nucleolus of a Class of Linear Production Games
by: Baïou, Mourad, et al.
Published: (2022)

The Cost and Complexity of Minimizing Envy in House Allocation
by: Madathil, Jayakrishnan, et al.
Published: (2024)

General Performance Evaluation for Competitive Resource Allocation Games via Unseen Payoff Estimation
by: Diamond, N'yoma, et al.
Published: (2024)

Classification aggregation: a quantitative impossibility theorem
by: Filmus, Yuval
Published: (2026)

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

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

Maximin Fair Allocation of Indivisible Items under Cost Utilities
by: Botan, Sirin, et al.
Published: (2024)

Approximately Dominating Sets in Elections
by: Charikar, Moses, et al.
Published: (2025)

Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
by: Lin, Zehan, et al.
Published: (2026)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
by: Takazawa, Kenjiro
Published: (2024)

Poset Positional Games
by: Bagan, Guillaume, et al.
Published: (2024)

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

Stable Menus of Public Goods: A Matching Problem
by: Fish, Sara, et al.
Published: (2024)

Matroids are Equitable
by: Akrami, Hannaneh, et al.
Published: (2025)

Dynamics of multidimensional Simple Clock Auctions
by: Zeroual, Jad, et al.
Published: (2025)

Game Connectivity and Adaptive Dynamics
by: Johnston, Tom, et al.
Published: (2023)

Asynchronous Majority Dynamics on Binomial Random Graphs
by: Mohan, Divyarthi, et al.
Published: (2023)

Between proportionnality and envy-freeness: k-proportionality
by: Chèze, Guillaume
Published: (2025)

On Connected Strongly-Proportional Cake-Cutting
by: Jankó, Zsuzsanna, et al.
Published: (2023)

Game connectivity and adaptive dynamics in many-action games
by: Johnston, Tom, et al.
Published: (2026)

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
by: Kanaya, Yuga, et al.
Published: (2025)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
by: Mauras, Simon, et al.
Published: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
by: Hollender, Alexandros, et al.
Published: (2025)