Name
Abstract | ||
|---|---|---|
The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorithms for this generalization are provided: a 1/2-approximation for any number of agents, a (1 - epsilon)-approximation for two agents, and a (8/9 - epsilon)-approximation for three agents. Apart from the extension to matroids, the (8/9 - epsilon)-approximation for three agents improves on a (7/8 - epsilon)-approximation by Amanatidis et al. (ICALP 2015). |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-57586-5_26 | ALGORITHMS AND COMPLEXITY (CIAC 2017) |
Keywords | Field | DocType |
Approximation algorithms,Fair division,Matroids | Matroid,Discrete mathematics,Approximation algorithm,Combinatorics,Minimax,Fair division,Polynomial,Computer science,Time complexity | Conference |
Volume | ISSN | Citations |
10236 | 0302-9743 | 3 |
PageRank | References | Authors |
0.39 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Gourvès | 1 | 241 | 30.97 |
| Jérôme Monnot | 2 | 512 | 55.74 |