arXiv (All)
open access
Online Fair Allocation with Best-of-Many-Worlds Guarantees
We investigate the online fair allocation problem with sequentially arriving items under various input models, with the goal of balancing fairness and efficiency. We propose the unconstrained PACE (Pacing According to Current Estimated utility) algorithm, a parameter-free allocation dynamic that req
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
- The Existence of Maximin Share Allocations is $Δ_2^P$-complete#1202211
- Strategyproof Multi-Resource Allocation in Cloud Computing via Adaptive-Speed Fairness#1142335
- The puzzle of competitive fairness#71491
- Credit Fairness: Online Fairness In Shared Resource Pools#614899
- Credit Fairness: Online Fairness In Shared Resource Pools#613932
Record · ID 1216126
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