Imagen de Portada

The Complexity of Extending Fair Allocations of Indivisible Goods

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Deligkas, Argyrios, Eiben, Eduard, Ganian, Robert, Goldsmith, Tiger-Lily, Ioannidis, Stavros D.
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Data Structures and Algorithms 91B32 F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Coordinated Motion Planning is FPT on Discretized Simple Polygons
por: Deligkas, Argyrios, et al.
Publicado: (2026)

EF1 and EFX Orientations
por: Deligkas, Argyrios, et al.
Publicado: (2024)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
por: Bredereck, Robert, et al.
Publicado: (2020)

Fair Division in a Variable Setting
por: Chandramouleeswaran, Harish, et al.
Publicado: (2024)

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

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

Fair distribution of bundles
por: Soberón, Pablo
Publicado: (2025)

Egalitarian Price of Fairness for Indivisible Goods
por: Celine, Karen Frilya, et al.
Publicado: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
por: Deligkas, Argyris, et al.
Publicado: (2025)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
por: Li, Bo, et al.
Publicado: (2024)

The Complexity of Fair Division of Indivisible Items with Externalities
por: Deligkas, Argyrios, et al.
Publicado: (2023)

Position Fair Mechanisms Allocating Indivisible Goods
por: Mahara, Ryoga, et al.
Publicado: (2024)

A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
por: Akrami, Hannaneh, et al.
Publicado: (2026)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
por: Livanos, Vasilis, et al.
Publicado: (2024)

Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
por: Peterseim, Benedikt, et al.
Publicado: (2026)

String 2-Covers with No Length Restrictions
por: Boneh, Itai, et al.
Publicado: (2024)

Hairpin Completion Distance Lower Bound
por: Boneh, Itai, et al.
Publicado: (2024)

Maximizing Diversity in (near-)Median String Selection
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
por: Crochemore, Maxime, et al.
Publicado: (2025)

Dynamic Necklace Splitting
por: Advani, Rishi, et al.
Publicado: (2025)

The Degree of Fairness in Efficient House Allocation
por: Hosseini, Hadi, et al.
Publicado: (2024)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
por: Kawase, Yasushi, et al.
Publicado: (2023)

The Exchange Problem
por: Garg, Mohit, et al.
Publicado: (2024)

Prediction-Augmented Mechanism Design for Weighted Facility Location
por: Shi, Yangguang, et al.
Publicado: (2025)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
por: Hummel, Halvard, et al.
Publicado: (2024)

Properties of Egalitarian Sequences of Committees: Theory and Experiments
por: Böhm, Paula, et al.
Publicado: (2025)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
por: Deligkas, Argyrios, et al.
Publicado: (2021)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Stability in Distance Preservation Games on Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Balanced and Fair Partitioning of Friends
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
por: Dreier, Jan, et al.
Publicado: (2026)

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
por: Bhaskar, Umang, et al.
Publicado: (2024)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Efficiency of Self-Adjusting Heaps
por: Sinnamon, Corwin, et al.
Publicado: (2023)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
por: Deligkas, Argyrios, et al.
Publicado: (2024)

The Secretary Problem with Predictions and a Chosen Order
por: Karisani, Helia, et al.
Publicado: (2026)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
por: Goldenberg, Elazar, et al.
Publicado: (2022)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)