On maximin share allocations in matroids
type: Item
instance of: scholarly article
title: On maximin share allocations in matroids
zbMATH Open document ID: 1407.68547
author: Laurent Gourvès
author: Jérôme Monnot
published in: Theoretical Computer Science
publication date: 2018-12-04T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6988751
zbMATH Keywords: approximation algorithms
zbMATH Keywords: fair division
zbMATH Keywords: matroids
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.05.018
OpenAlex ID: W2803597015
cites work: Approximation Algorithms for Computing Maximin Share Allocations
cites work: An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
cites work: Q4338900
cites work: Comments on bases in dependence structures
cites work: Equitable distribution of indivisible objects
cites work: Approximate Maximin Share Allocations in Matroids
cites work: A Protocol for Cutting Matroids Like Cakes
cites work: Q5282999
cites work: Worst case compromises in matroids with applications to the allocation of indivisible goods
cites work: A Multiple Exchange Property for Bases
cites work: Some Abstract Pivot Algorithms
cites work: Partitioning general probability measures
cites work: Greedoids
cites work: Combinatorial optimization. Theory and algorithms.
cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time
cites work: An exchange theorem for bases of matroids
Wikidata QID: Q129824788
DOI: 10.1016/J.TCS.2018.05.018
description: scientific article; zbMATH DE number 6988751