Article ID Journal Published Year Pages File Type
10523958 Operations Research Letters 2013 4 Pages PDF
Abstract
We prove that such a result also exists when there are two players and any number of cakes and when there are three players and two cakes. The proof relies on the fractional matching number in m-partite hypergraphs.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Envy-free two-player m-cake and three-player two-cake divisions
Authors
, , ,