Abstract
Abstract We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [ 0 , 1 ] 2 , where ( 0 , 0 ) ∈ P ; Bob cuts out n axis-parallel rectangles with disjoint interiors, each of them having a point of P as the lower left corner; Alice keeps the rest. It has been conjectured that Bob can always secure at least half of the cake. This remains unsettled, and it is not even known whether Bob can get any positive fraction independent of n. We prove that if Alice can force Bobʼs share to tend to zero, then she must use very many points; namely, to prevent Bob from gaining more than 1 / r of the cake, she needs at least 2 2 Ω ( r ) points.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
