arXiv (All)
open access
Online Fair Division with Upgrade Recourse
We study the online fair division of indivisible goods. In the standard model, where assignments are irrevocable, no algorithm can guarantee any positive fraction of the maximin share (MMS). Reassigning earlier goods can restore fairness, but it may take value away from agents who already hold them.
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
- Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna#1355542
- Reaching Fairness by Reallocating Goods#818724
- Reaching Fairness by Reallocating Goods#808732
- Polynomial Algorithms for Simultaneous Share-Based and Envy-Based Guarantees#1326687
- Non-Existence of PMMS Allocations and a $4/3$-PMMS Guarantee for Additive Chores#997365
Record · ID 1341825
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