Weighted fair division of indivisible items: a review

DOI10.1016/J.IPL.2024.106519zbMATH Open1544.91167MaRDI QIDQ6602330FDOQ6602330

Authors: Warut Suksompong 

Publication date: 11 September 2024

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

Recommendations

• Fair Division
• Fair division of indivisible items
• Picking sequences and monotonicity in weighted fair division
• Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness
• On fair division for indivisible items

Mathematics Subject Classification ID

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

Cites Work

• Proportional representation. Apportionment methods and their applications. With a foreword by Andrew Duff
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fair Allocation of Indivisible Goods
• Almost envy-freeness with general valuations
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• Fair division of indivisible goods: recent progress and open questions
• Fair enough: guaranteeing approximate maximin shares
• Cake-cutting with different entitlements: how many cuts are needed?
• Fair allocation of indivisible goods: beyond additive valuations
• A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
• Fair Allocation of Indivisible Goods to Asymmetric Agents
• Competitive equilibrium with indivisible goods and generic budgets
• Fair division with binary valuations: one rule to rule them all
• Picking sequences and monotonicity in weighted fair division
• Disproportionate division
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• On maximum weighted Nash welfare for binary valuations
• 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

Cited In (1)

• Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness

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)