<?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="Chore division - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=chore_division&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=chore_division&amp;p=3">3.Next</a>
</p>
<p>resources are nonuniform. In cake division, cakes can have edge, corner, and middle pieces along with different amounts of frosting. Whereas in chore division, there are different chore types and different amounts of time needed to finish each chore. Similarly, both problems assume that the resources are divisible. Chores can be infinitely divisible, because the finite set of chores can be partitioned by chore or by time. For example, a load of laundry could be partitioned by the number of articles of clothing and/or by the amount of time spent</p><p>
<a accesskey="1" href="page.php?w=chore_division&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=chore_division&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
