arxiv
PublishedMay 29, 2026 at 4:00 AM
—neutral
Approximate Proportionality in Online Fair Division
Publisher summary· verbatim
arXiv:2508.03253v2 Announce Type: replace-cross Abstract: We study the online fair division problem, where indivisible goods arrive sequentially and must be allocated immediately and irrevocably. Prior work establishes strong impossibility results for approximating classic notions such as envy-freen
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivFederatedSkill: Federated Learning for Agentic Skill Evolution16harxivToward a Modular Architecture for Embedded AI Agent Systems at the Edge16harxivA Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation16harxivAnomalies in Multivariate Time Series Benchmarks Are Mostly Univariate16hThe Bubble Brief
WEEKLYRead fair-division insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗