A Protocol for Cutting Matroids Like Cakes

DOI10.1007/978-3-642-45046-4_18zbMath1406.91217OpenAlexW1833152703MaRDI QIDQ2937759

Jérôme Monnot, Lydia Tlilane, Laurent Gourvès

Publication date: 12 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45046-4_18

zbMATH Keywords

matroidsfair allocation of indivisible goods

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (4)

Approximate Maximin Share Allocations in Matroids ⋮ On maximin share allocations in matroids ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Worst case compromises in matroids with applications to the allocation of indivisible goods

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning general probability measures
• Equitable distribution of indivisible objects
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Worst case compromises in matroids with applications to the allocation of indivisible goods
• On the complexity of achieving proportional representation
• The Santa Claus problem
• Approximation Algorithms for the Max-Min Allocation Problem
• Some Abstract Pivot Algorithms
• An Envy-Free Cake Division Protocol
• An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: A Protocol for Cutting Matroids Like Cakes