Computing welfare-Maximizing fair allocations of indivisible goods

Keyphrases

• NP-hard 100%
• Fair Allocation 100%
• Utilitarian 100%
• Allocation of Indivisible Goods 100%
• Two-agent 50%
• Polynomial Time 50%
• Time Algorithm 50%
• Computational Problems 50%
• Strong NP-hardness 50%
• Social Welfare 50%
• Envy-freeness 50%
• Runtime Complexity 50%
• Utilitarian Welfare 50%
• Pseudo-polynomial Time 50%
• Fairness Notion 50%
• Envy-free up to One Item 50%
• PROP1 50%

Computer Science

• Proportionality 100%
• Polynomial Time 50%
• Computational Problem 50%
• Runtime Complexity 50%
• Strong Fairness 50%

Mathematics

• Fixed Number 100%
• Polynomial Time 50%
• Computational Problem 50%