Edmonds–Pruhs protocol
id:
edmonds-pruhs-protocol-249-3877019
title:
Edmonds–Pruhs protocol
text:
Edmonds–Pruhs protocol is a protocol for fair cake-cutting. Its goal is to create a partially proportional division of a heterogeneous resource among n people, such that each person receives a subset of the cake which that person values as at least 1/an of the total, where a ≥ 10 is some sufficiently large constant. It is a randomized algorithm whose running time is O(n) with probability close to 1. The protocol was developed by Jeff Edmonds and Kirk Pruhs, who later improved it in joint work wi
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Edmonds%E2%80%93Pruhs_protocol
date created:
date modified:
2023-07-23T07:57:17Z
main entity:
{"identifier":"Q18206736","url":"https://www.wikidata.org/entity/Q18206736"}
image:
fields total:
13
integrity:
13