Maximin fair allocation of indivisible items under cost utilities

DOI10.1007/978-3-031-43254-5_13MaRDI QIDQ6546293zbMATH OpenFDO

Authors Sirin Botan, Angus Ritossa, Mashbat Suzuki, Toby Walsh

Publication date 29 May 2024

zbMATH Keywords

resource allocationfair divisionmaximin fair share

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Minimax problems in mathematical programming (90C47)

Recommendations

• Fair allocation of indivisible goods: improvement
• Fair enough: guaranteeing approximate maximin shares
• Approximating maximin share allocations
• A tight negative example for MMS fair allocations
• An improved approximation algorithm for maximin shares

Cites work

• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
• A tight negative example for MMS fair allocations
• An improved approximation algorithm for maximin shares
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair allocation of indivisible goods: beyond additive valuations
• Fair division with binary valuations: one rule to rule them all
• Fair enough: guaranteeing approximate maximin shares
• Generalized binary utility functions and fair allocations
• Handbook of Computational Social Choice
• Santa claus meets hypergraph matchings
• The Santa Claus problem

This page was built for publication: Maximin fair allocation of indivisible items under cost utilities

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