Approximation algorithms for computing maximin share allocations

DOI10.1007/978-3-662-47672-7_4zbMATH Open1409.68327OpenAlexW2776361207MaRDI QIDQ3448772FDOQ3448772

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

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

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)

Cites Work

• Title not available (Why is that?)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• The Santa Claus problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of cake cutting
• Fair enough: guaranteeing approximate maximin shares

Cited In (21)

• 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
• 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
• Keep your distance: land division with separation
• Title not available (Why is that?)
• Asymptotic existence of fair divisions for groups
• Approximate maximin shares for groups of agents
• Approximation Algorithms for Computing Maximin Share Allocations
• Maximin share allocations on cycles
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• Fair allocation of indivisible goods: improvement

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)