Efficient Nearly-Fair Division with Capacity Constraints

Keyphrases

• Fair Division 100%
• Capacity Constraints 100%
• Pareto Optimal 66%
• Two-agent 33%
• Envy-free 33%
• Polynomial-time Algorithm 33%
• Indivisible Items 33%
• Additive Utility 33%
• Envy-free up to One Item 33%
• ArXiv 33%

Mathematics

• Pareto Optimal 100%
• Main Result 50%
• Upper Bound 50%
• Polynomial Time 50%
• Good Item 50%

Computer Science

• Capacity Constraint 100%
• polynomial-time algorithm 33%
• Feasible Allocation 33%