No Agent Left Behind: Dynamic Fair Division of Multiple Resources

DOI10.1613/JAIR.4405MaRDI QIDQ2938474zbMATH OpenOpenAlexFDO

Authors Ian A. Kash, Ariel D. Procaccia, Nisarg Shah

Publication date 14 January 2015

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4405

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42)

Recommendations

• Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
• Fair and efficient allocation with few agent types, few item types, or small value levels
• scientific article; zbMATH DE number 2088164
• Decentralized Resource Allocation in Dynamic Networks of Agents
• scientific article; zbMATH DE number 5017566
• Fair allocation of indivisible goods: the two-agent case

Cited in

(11)

• Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems
• Cake cutting: explicit examples for impossibility results
• A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism
• Dynamic fair resource division
• Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks
• Monotonicity and competitive equilibrium in cake-cutting
• Fair division of indivisible goods: recent progress and open questions
• Extended efficiency and soft-fairness multiresource allocation in a cloud computing system
• Fair and efficient multi-resource allocation for cloud computing
• The price to pay for forgoing normalization in fair division of indivisible goods
• Computing a small agreeable set of indivisible items

This page was built for publication: No Agent Left Behind: Dynamic Fair Division of Multiple Resources

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