arXiv (All)
open access
A Note on EFX Inapproximability for Chores
We study the approximability of envy-free up to any item (EFX) allocations for indivisible chores under complement-free cost functions. Our main result is an instance with $255$ agents and $764$ chores with binary XOS cost functions, in which no $α$-EFX allocation exists for any $1\leα<2$. The const
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- EF1-Constrained Nash Social Welfare with Identical Additive Valuations: Complexity, Guarantees, and Experiments#1084368
- Weighted Fair Division of Indivisible Mixed Manna#971885
- Non-Existence of PMMS Allocations and a $4/3$-PMMS Guarantee for Additive Chores#997365
- Subquadratic Subsidies for Nonnegative or Nonpositive Valuations#985643
- Almost Envy-Freeness for Additive Mixed Manna with Entitlements: Deterministic and Randomized Guarantees#924860
Record · ID 1155208
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive