arXiv (OAI Expanded)
open access
Online Fair Division: Pushing the Frontier of Approximate Proportionality
Online fair division captures allocation problems in which indivisible resources arrive over time and must be assigned before future resources are known. Understanding what fairness remains achievable when allocation decisions are immediate and irrevocable is a fundamental question in this setting.
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
- Online Fair Allocation with Best-of-Many-Worlds Guarantees#1216126
- Fair equality of chances for prediction-based decisions#706235
- Strategyproof Multi-Resource Allocation in Cloud Computing via Adaptive-Speed Fairness#1142335
- Online Covering with Maximum Delay under Subadditive Service Costs#1117006
- Be Intentional About Fairness!: Fairness, Size, and Multiplicity in the Rashomon Set#725390
Record · ID 1210092
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