Approximate Maximin Share Allocations in Matroids

DOI10.1007/978-3-319-57586-5_26zbMath1407.68546OpenAlexW2606640350MaRDI QIDQ5283377

Laurent Gourvès, Jérôme Monnot

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_26

zbMATH Keywords

matroidsfair divisionapproximation algorithms

Mathematics Subject Classification ID

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

Related Items (4)

On maximin share allocations in matroids ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Maximin share guarantee for goods with positive externalities ⋮ Approximate maximin shares for groups of agents

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• An exchange theorem for bases of matroids
• A Protocol for Cutting Matroids Like Cakes
• Approximation Algorithms for Computing Maximin Share Allocations
• Some Abstract Pivot Algorithms
• An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
• Comments on bases in dependence structures
• A Multiple Exchange Property for Bases
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Approximate Maximin Share Allocations in Matroids