Weighted fair division of indivisible items: a review

DOI10.1016/j.ipl.2024.106519zbMATH Open1544.91167MaRDI QIDQ6602330

Warut Suksompong

Publication date: 11 September 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• The complexity of cake cutting with unequal shares
• Picking sequences and monotonicity in weighted fair division
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• Cake-cutting with different entitlements: how many cuts are needed?
• A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
• Fair allocation of indivisible goods: beyond additive valuations
• On maximum weighted Nash welfare for binary valuations
• Fair division with binary valuations: one rule to rule them all
• Proportional Representation
• Fair Enough
• Fair Allocation of Indivisible Goods to Asymmetric Agents
• Competitive Equilibrium with Indivisible Goods and Generic Budgets
• Almost Envy-Freeness with General Valuations
• Fair Allocation of Indivisible Goods
• Disproportionate division
• Fair division of indivisible goods: recent progress and open questions
• Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness
• Breaking the 3/4 barrier for approximate maximin share
• Approximation algorithms for the weighted Nash social welfare via convex and non-convex programs

This page was built for publication: Weighted fair division of indivisible items: a review

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602330)