Computing envy-freeable allocations with limited subsidies

DOI10.1007/978-3-030-94676-0_29MaRDI QIDQ2152144zbMATH OpenOpenAlexFDO

Authors I. Caragiannis, Stavros D. Ioannidis

Publication date 6 July 2022

Full work available at URL https://arxiv.org/abs/2002.02789

zbMATH Keywords

approximation algorithmsfair divisionindivisible goodssubsidy minimization

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Recommendations

• Fair division with subsidy
• A fair and truthful mechanism with limited subsidy
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Almost envy-freeness with general valuations
• An algorithm for envy-free allocations in an economy with indivisible objects and money

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• A Little Charity Guarantees Almost Envy-Freeness
• A derivation of the money rawlsian solution
• Almost envy-freeness with general valuations
• An algorithm for envy-free allocations in an economy with indivisible objects and money
• Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
• Complexity of approximating bounded variants of optimization problems
• Distributed fair allocation of indivisible goods
• Envy-free and Pareto efficient allocations in economies with indivisible goods and money
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Fair division with subsidy
• Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• Optimal Auction Design
• Rental Harmony: Sperner's Lemma in Fair Division

Cited in

(6)

• Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective
• Efficient Fair Division with Minimal Sharing
• Fair division of indivisible goods: recent progress and open questions
• A fair and truthful mechanism with limited subsidy
• A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget
• An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities

This page was built for publication: Computing envy-freeable allocations with limited subsidies

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