Maximin fair allocation of indivisible items under cost utilities

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

Mashbat Suzuki, Toby Walsh, Sirin Botan, Angus Ritossa

Publication date: 29 May 2024

zbMATH Keywords

resource allocationfair divisionmaximin fair share

Mathematics Subject Classification ID

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

Cites Work

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

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)