arXiv (All)
open access
Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that must be irrevocably allocated to one of the agents to achieve a desired balance between fairness and efficiency. Existing algorithms as
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
- Learning Fair Allocation of Indivisible Items from Limited Feedback#792780
- Learning Fair Allocation of Indivisible Items from Limited Feedback#788780
- Single-or-Sample: Online Fair Allocation for Combinatorial Agents#1116617
- On the Hardness of Maximin Share Allocations#1109881
- Online Fair Division Against an Oblivious Adversary#1064936
Record · ID 821391
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