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...
9 KB (1,583 words) - 07:57, 23 July 2023
is the son of another mathematician, Jack Edmonds. Edmonds–Pruhs protocol Chattopadhyay, Arkadev; Edmonds, Jeff; Ellen, Faith; Pitassi, Toniann (2016)...
5 KB (382 words) - 05:01, 18 June 2025
where a {\displaystyle a} is some sufficiently large constant. The Edmonds–Pruhs protocol is a randomized algorithm whose analysis make use of balls-into-bins...
13 KB (1,958 words) - 02:36, 7 March 2025
which can guarantee that the pieces are connected. Edmonds–Pruhs protocol is a randomized protocol that requires only O(n) actions, but guarantees only...
30 KB (4,312 words) - 02:36, 5 July 2025
guaranteeing partial proportionality with disconnected pieces; see Edmonds–Pruhs algorithm. It is possible to use randomization in order to reduce the...
6 KB (986 words) - 20:00, 2 April 2025
scheme is selecting the final pieces in step #4. For details, see Edmonds–Pruhs protocol. The hardness results are stated in terms of the Robertson–Webb...
24 KB (3,416 words) - 22:01, 23 December 2024