arXiv (All)
open access
Online Fair Division of Chores with Upgrade Recourse
We study the online fair division of indivisible chores among $n$ agents under upgrade recourse, where earlier assignments may be revised but each chore previously assigned to an agent must be replaced by a distinct chore that she finds no more costly. We show that a simple adaptation of round robin
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
- Comparison-Based Fair Division of Indivisible Chores#986017
- 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
- Research, Teaching and Service: Why Shouldn't Women's Work Count?#759105
- Agent-Based Computational Economics: Overview and Brief History#168042
Record · ID 1536262
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