arXiv (All)
open access
Online Fair Division Against an Oblivious Adversary
We study the online allocation of indivisible goods among $n$ agents, where each good must be allocated immediately and irrevocably upon arrival. Against an adaptive adversary, Neoh and Teh [2026] proved that no algorithm can guarantee a positive approximation to proportionality up to one good (PROP
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
- Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies#821391
- Closing Gaps in Online Fair Division#986361
- Strategyproof Multi-Resource Allocation in Cloud Computing via Adaptive-Speed Fairness#1142335
- Single-or-Sample: Online Fair Allocation for Combinatorial Agents#1116617
- Trading Proportionality for Strategic Robustness in Multi-Winner Approval Voting#1063977
Record · ID 1064936
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