Approximation algorithms for computing maximin share allocations

DOI10.1007/978-3-662-47672-7_4MaRDI QIDQ3448772zbMATH OpenOpenAlexFDO

Authors Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi

Publication date 27 October 2015

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL http://repository.essex.ac.uk/27279/1/journal-mms_acm_alt.pdf

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Approximation algorithms (68W25) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Approximation Algorithms for Computing Maximin Share Allocations
• Fair enough: guaranteeing approximate maximin shares
• An improved approximation algorithm for maximin shares
• Approximate maximin share allocations in matroids
• On maximin share allocations in matroids

Cites work

• scientific article; zbMATH DE number 5485443 (Why is no real title available?)
• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Fair enough: guaranteeing approximate maximin shares
• On the complexity of cake cutting
• The Santa Claus problem

Cited in

(22)

• Fair allocation of indivisible goods: improvement
• An approximation algorithm for max-min fair allocation of indivisible goods
• Approximating the Nash Social Welfare with Indivisible Items
• Maximin share guarantee for goods with positive externalities
• Faster min-max resource sharing in theory and practice
• Asymptotic existence of proportionally fair allocations
• On maximin share allocations in matroids
• Fair enough: guaranteeing approximate maximin shares
• Approximating maximin share allocations
• Approximate maximin share allocations in matroids
• Collective decision making
• Local fairness in hedonic games via individual threshold coalitions
• The fair division of hereditary set systems
• An improved approximation algorithm for maximin shares
• Sharing-group allocation problems
• Asymptotic existence of fair divisions for groups
• scientific article; zbMATH DE number 4160481 (Why is no real title available?)
• Approximate maximin shares for groups of agents
• Keep your distance: land division with separation
• Approximation Algorithms for Computing Maximin Share Allocations
• Maximin share allocations on cycles
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem

This page was built for publication: Approximation algorithms for computing maximin share allocations

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