The budgeted maximin share allocation problem

DOI10.1007/S11590-024-02145-6MaRDI QIDQ6968705zbMATH OpenFDO

Authors Bin Deng, Weidong Li

Publication date 24 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02145-6

zbMATH Keywords

fair allocationbudget constraintsmaximin-share

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Mathematical economics (91Bxx) Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A new approximation technique for resource-allocation problems
• A tight negative example for MMS fair allocations
• An approximation algorithm for max-min fair allocation of indivisible goods
• An improved approximation algorithm for maximin shares
• Approximating maximin share allocations
• Approximation Algorithms for Computing Maximin Share Allocations
• Breaking the 3/4 barrier for approximate maximin share
• Fair allocation of indivisible goods: beyond additive valuations
• Fair enough: guaranteeing approximate maximin shares
• On allocating goods to maximize fairness
• Polynomial-time combinatorial algorithm for general max-min fair allocation
• The multiple subset sum problem

Cited in

(2)

• Approximate maximin share allocation for indivisible goods under a knapsack constraint
• Maximin share allocation under knapsack constraints

This page was built for publication: The budgeted maximin share allocation problem

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