<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Fair cake-cutting - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Fair_cake-cutting&amp;p=2">3.Next</a>
</p>
<p><b>Fair cake-cutting</b> is a kind of <a href="page.php?w=fair_division">fair division</a> problem. The problem involves a heterogeneous resource, such as a cake with different toppings, that is assumed to be divisible - it is possible to cut <a href="page.php?w=arbitrarily_small">arbitrarily small</a> pieces of it without destroying their value. The resource has to be divided among several partners who have different preferences over different parts of the cake, e.g., some people prefer the chocolate toppings, some prefer the cherries, some</p><p>
<a accesskey="3" href="page.php?w=Fair_cake-cutting&amp;p=2">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
