Robertson–Webb envy-free cake-cutting algorithm
id:
robertson-webb-envy-free-cake-cutting-algorithm-288-9474911
title:
Robertson–Webb envy-free cake-cutting algorithm
text:
The Robertson–Webb protocol is a protocol for envy-free cake-cutting which is also near-exact. It has the following properties: It works for any number (n) of partners.
It works for any set of weights representing different entitlements of the partners.
The pieces are not necessarily connected, i.e. each partner might receive a collection of small "crumbs".
The number of queries is finite but unbounded – it is not known in advance how many queries will be needed. The protocol was developed by Ja
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Robertson%E2%80%93Webb_envy-free_cake-cutting_algorithm
date created:
date modified:
2021-07-16T12:28:04Z
main entity:
{"identifier":"Q25303735","url":"https://www.wikidata.org/entity/Q25303735"}
image:
fields total:
13
integrity:
13