Approximation Algorithms for Computing Maximin Share Allocations

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

Georgios Amanatidis, Afshin Nikzad, Evangelos Markakis, 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)

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

Cited In (16)

• 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
• Collective decision making
• Local fairness in hedonic games via individual threshold coalitions
• The fair division of hereditary set systems
• 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
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• Approximate Maximin Share Allocations in Matroids

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)