Maximin fair allocation of indivisible items under cost utilities

DOI10.1007/978-3-031-43254-5_13zbMATH Open1537.91127MaRDI QIDQ6546293FDOQ6546293

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

Publication date: 29 May 2024

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

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)

Cites Work

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

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)