Fair cake-cutting
id:
fair-cake-cutting-267-10615648
title:
Fair cake-cutting
text:
Fair cake-cutting is a kind of fair division 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 arbitrarily small 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, i.e., some people prefer the chocolate toppings, some prefer the cherries, some just want as large a piece as possible. T
brand slug:
wiki
category slug:
encyclopedia
description:
Fair division problem
original url:
https://en.wikipedia.org/wiki/Fair_cake-cutting
date created:
date modified:
2024-03-30T07:46:09Z
main entity:
{"identifier":"Q18206991","url":"https://www.wikidata.org/entity/Q18206991"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/0f/Cut_the_Cake_%283032677729%29.jpg","width":3976,"height":2370}
fields total:
13
integrity:
15