Envy-free two-player \(m\)-cake and three-player two-cake divisions

DOI10.1016/j.orl.2013.07.010zbMath1287.91101OpenAlexW2069333429MaRDI QIDQ2450739

Quentin Carbonneaux, Nicolas Lebert, Frédéric Meunier

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.07.010

zbMATH Keywords

matchingpolytopeSperner's lemmaenvy-freefair division\(m\)-partite hypergraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (6)

Envy-free division of multi-layered cakes ⋮ Fair multi-cake cutting ⋮ Multi resource allocation with partial preferences ⋮ Fair division with multiple pieces ⋮ Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• Maximum degree and fractional matchings in uniform hypergraphs
• A polytopal generalization of Sperner's lemma
• Two-player envy-free multi-cake division
• Rental Harmony: Sperner's Lemma in Fair Division
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly

This page was built for publication: Envy-free two-player \(m\)-cake and three-player two-cake divisions