Researchers have developed a new method to minimize cumulative envy when allocating a sequence of indivisible items. This approach considers the duration and magnitude of envy over time, introducing 'cumulative maximum envy' as a key metric. While the problem is NP-complete even for simple valuation scenarios, the study presents a dynamic programming solution for a fixed number of agents and an FPTAS for identical integer valuations. Additionally, a greedy algorithm offers approximation guarantees for the variant where the arrival order can be chosen. AI
RANK_REASON Academic paper on a theoretical computer science and game theory problem. [lever_c_demoted from research: ic=1 ai=0.4]
Read on arXiv cs.MA (Multiagent) →
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →