Cover Image

A Note on EFX Inapproximability for Chores

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Christoforidis, Vasilis
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On The Pursuit of EFX for Chores: Non-Existence and Approximations
by: Christoforidis, Vasilis, et al.
Published: (2024)

Existence of 2-EFX Allocations of Chores
by: Garg, Jugal, et al.
Published: (2025)

Constant-Factor EFX Exists for Chores
by: Garg, Jugal, et al.
Published: (2024)

Approximately EFX and PO Allocations for Bivalued Chores
by: Lin, Zehan, et al.
Published: (2025)

Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
by: Afshinmehr, Mahyar, et al.
Published: (2024)

Fair and Truthful Allocations Under Leveled Valuations
by: Christodoulou, George, et al.
Published: (2024)

A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna
by: Li, Bo, et al.
Published: (2024)

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

Improving the Price of Anarchy via Predictions in Parallel-Link Networks
by: Christodoulou, George, et al.
Published: (2025)

Maximin Share Guarantees for Few Agents with Subadditive Valuations
by: Christodoulou, George, et al.
Published: (2025)

EFX Orientations of Multigraphs
by: Hsu, Kevin
Published: (2024)

Distribution of Chores with Information Asymmetry
by: Hosseini, Hadi, et al.
Published: (2023)

Online MMS Allocation for Chores
by: Song, Jiaxin, et al.
Published: (2025)

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

Improved Approximate EFX Guarantees for Multigraphs
by: Kaviani, Alireza, et al.
Published: (2025)

Equitable Allocations of Mixtures of Goods and Chores
by: Hosseini, Hadi, et al.
Published: (2025)

Tâtonnement Dynamics for Fisher Markets with Chores
by: Chaudhury, Bhaskar Ray, et al.
Published: (2025)

Fair Interval Scheduling of Indivisible Chores
by: Equbal, Sarfaraz, et al.
Published: (2024)

Existence of EFX for Two Additive Valuations
by: Mahara, Ryoga
Published: (2020)

Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
by: Anagnostides, Ioannis, et al.
Published: (2026)

On Optimal Tradeoffs between EFX and Nash Welfare
by: Feldman, Michal, et al.
Published: (2023)

EFX Allocations on Some Multi-graph Classes
by: Bhaskar, Umang, et al.
Published: (2024)

Epistemic EFX Allocations Exist for Monotone Valuations
by: Akrami, Hannaneh, et al.
Published: (2024)

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

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

Fair Division with Indivisible Goods, Chores, and Cake
by: Aziz, Haris, et al.
Published: (2025)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)

Existence of Fair and Efficient Allocation of Indivisible Chores
by: Mahara, Ryoga
Published: (2025)

Fair Assignment of Indivisible Chores to Asymmetric Agents
by: Seddighin, Masoud, et al.
Published: (2025)

EFX and PO Allocation Exists for Two Types of Goods
by: Davidiuk, Vladimir, et al.
Published: (2026)

Achieving EF1 and Epistemic EFX Guarantees Simultaneously
by: Akrami, Hannaneh, et al.
Published: (2026)

Approximate-EFX Allocations with Ordinal and Limited Cardinal Information
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

EFX Allocations Exist on Triangle-Free Multi-Graphs
by: Afshinmehr, Mahyar, et al.
Published: (2025)

Lower Bound for Online MMS Assignment of Indivisible Chores
by: Seddighin, Masoud, et al.
Published: (2025)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

On the Fairness of Normalized p-Means for Allocating Goods and Chores
by: Eckart, Owen, et al.
Published: (2024)

When is Truthfully Allocating Chores no Harder than Goods?
by: Li, Bo, et al.
Published: (2025)

Pure-Circuit: Tight Inapproximability for PPAD
by: Deligkas, Argyrios, et al.
Published: (2022)

One Action Too Many: Inapproximability of Budgeted Combinatorial Contracts
by: Feldman, Michal, et al.
Published: (2025)