arXiv (All)
open access
Comparison-Based Fair Division of Indivisible Chores
We investigate the query complexity of fairly allocating $m$ indivisible chores among $n$ agents with additive cost functions. We depart from the standard cardinal model and assume only comparison access: an algorithm may ask an agent which of two bundles is less costly, but never observes numerical
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
- Revisiting EFX and fPO Allocations for Binary Chores#1083458
- Bidding graph games with partially-observable budgets#384950
- Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling#423922
- On the Incompatibility of Weighted PROPX and Pareto Optimality for Indivisible Chores#620544
- On the Incompatibility of Weighted PROPX and Pareto Optimality for Indivisible Chores#618865
Record · ID 986017
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