arXiv (All)
open access
Randomized Online Fair Division: High-Probability and Expected Realized Fairness
We study randomized algorithms for the fully online allocation of indivisible goods among $n\ge2$ agents with nonnegative additive valuations. Goods arrive one by one and must be allocated immediately and irrevocably. Nothing is known in advance except the number of agents. Since exact ex-ante envy
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
- Differentially Private Multicolor Discrepancy and Fair Division of Indivisible Goods#1109392
- Dicey games: Shared sources of randomness in distributed systems#449044
- The antitrust paradox#1148244
- Generalized Immodesty Principles in Epistemic Utility Theory#718434
- Optimal Analysis of Greedy for Stochastic Online Euclidean Matching#1050136
Record · ID 1049316
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