Maximin share allocation under knapsack constraints

DOI10.1007/978-981-96-1090-7_30MaRDI QIDQ6970715zbMATH OpenFDO

Authors Bin Deng

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_30

zbMATH Keywords

fair allocationknapsack constraintsmaximin share

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A self-contained karma economy for the dynamic allocation of common resources
• A tight negative example for MMS fair allocations
• 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 to Asymmetric Agents
• Fair allocation of indivisible goods: beyond additive valuations
• Fair allocation of indivisible goods: improvement
• Fair enough: guaranteeing approximate maximin shares
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
• Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• The budgeted maximin share allocation problem

This page was built for publication: Maximin share allocation under knapsack constraints

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