<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>690</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-05-07</completedDate>
    <publishedDate>2002-05-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">How to Cut a Cake Almost Fairly</title>
    <abstract language="eng">In the cake cutting problem, $n\ge2$ players want to cut a cake into $n$ pieces so that every player gets a ``fair'' share of the cake by his own measure. We describe a protocol with $n-1$~cuts in which each player can enforce to get a share of at least~$1/(2n-2)$. Moreover we show that no protocol with $n-1$~cuts can guarantee a better fraction.</abstract>
    <identifier type="serial">02-23</identifier>
    <identifier type="opus3-id">691</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6905</identifier>
    <enrichment key="SourceTitle">Appeared in: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 263-264</enrichment>
    <author>Sven Krumke</author>
    <author>Maarten Lipmann</author>
    <author>Willem de Paepe</author>
    <author>Diana Poensgen</author>
    <author>Jörg Rambau</author>
    <author>Leen Stougie</author>
    <author>Gerhard Woeginger</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-23</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Fair division</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>cake cutting</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="91A06">n-person games, n &gt; 2</collection>
    <collection role="msc" number="91A10">Noncooperative games</collection>
    <collection role="msc" number="91A80">Applications of game theory</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/690/ZR-02-23.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/690/ZR-02-23.pdf</file>
  </doc>
</export-example>
