Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks

DOI10.1007/978-981-19-8152-4_19MaRDI QIDQ6535287zbMATH OpenFDO

Authors Bin Deng, Weidong Li

Publication date 2 December 2023

Full work available at URL https://doi.org/10.1007/978-981-19-8152-4_19

zbMATH Keywords

cloud computingmaximin sharemulti-resource fair allocation

Mathematics Subject Classification ID

Distributed systems (68M14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• On the efficiency of the proportional allocation mechanism for divisible resources
• On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
• A new fairness notion in the assignment of indivisible resources
• An approximation algorithm for max-min fair allocation of indivisible goods
• Distributed fair allocation of indivisible goods
• The problem of fair division for a hybrid resource
• Fair allocation algorithms for indivisible items under structured conflict constraints
• Finding maxmin allocations in cooperative and competitive fair division
• A decentralized adaptive algorithm for fair allocation of a shared resource
• On resource monotonicity in the fair division problem

Cites work

• A further analysis of the dynamic dominant resource fairness mechanism
• Fair enough: guaranteeing approximate maximin shares
• No Agent Left Behind: Dynamic Fair Division of Multiple Resources
• No justified complaints: on fair sharing of multiple resources
• Strategy-proof mechanism for online resource allocation in cloud and edge collaboration
• Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems

Cited in

(4)

• On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
• Fair and efficient multi-resource allocation for cloud computing
• Multi-resource allocation in mobile edge computing systems: a trade-off on fairness and efficiency
• Maximin share allocation under knapsack constraints

This page was built for publication: Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks

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