A new paper published on arXiv introduces an online variant of discrete fair division under generalized assignment budget constraints. The research addresses scenarios where goods arrive sequentially and must be assigned irrevocably, with fairness evaluated against budget-feasible subsets. The paper demonstrates that without specific structural conditions, no deterministic online algorithm can guarantee a fixed approximation to feasible envy-freeness. However, by identifying a 'bounded density spread' condition, the authors develop approximation algorithms that offer improved guarantees, particularly for arbitrary item sizes and common valuations. AI
IMPACT This research contributes to theoretical advancements in fair division algorithms, potentially influencing future applications in resource allocation and multi-agent systems.
RANK_REASON The cluster contains a single academic paper published on arXiv. [lever_c_demoted from research: ic=1 ai=0.4]
Read on arXiv cs.MA (Multiagent) →
- alphaXiv
- arXiv
- CatalyzeX Code Finder for Papers
- computer science
- CORE Recommender
- DagsHub
- game theory
- Gotit.pub
- Hugging Face
- Influence Flower
- ScienceCast
AI-generated summary · Google Gemini · from 2 sources. How we write summaries →
