Approximate maximin share allocations in matroids
From MaRDI portal
Publication:5283377
DOI10.1007/978-3-319-57586-5_26zbMATH Open1407.68546OpenAlexW2606640350MaRDI QIDQ5283377FDOQ5283377
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
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Approximation algorithms (68W25) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Combinatorial optimization. Theory and algorithms.
- Approximation Algorithms for Computing Maximin Share Allocations
- Title not available (Why is that?)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Some Abstract Pivot Algorithms
- A Multiple Exchange Property for Bases
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
- An exchange theorem for bases of matroids
- Comments on bases in dependence structures
- Title not available (Why is that?)
- A Protocol for Cutting Matroids Like Cakes
Cited In (6)
- Maximin share guarantee for goods with positive externalities
- Fair allocation of indivisible goods: beyond additive valuations
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- On maximin share allocations in matroids
- Approximate maximin shares for groups of agents
- Approximation Algorithms for Computing Maximin Share Allocations
This page was built for publication: Approximate maximin share allocations in matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283377)
