Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Austin moving-knife procedures (view)

searching for Moving-knife procedure 6 found (19 total)

Dubins–Spanier theorems (1,905 words) [view diff] no match in snippet view article find links to article

The Dubins–Spanier theorems are several theorems in the theory of fair cake-cutting. They were published by Lester Dubins and Edwin Spanier in 1961. Although

Chore division (2,150 words) [view diff] exact match in snippet view article find links to article

chores, since they guarantee equal values. An example is the Austin moving-knife procedure, which guarantees each partner a piece that he values as exactly

Fink protocol (461 words) [view diff] exact match in snippet view article find links to article

protocol for super-proportional division for n players. Austin moving-knife procedure, giving each partner a piece that he values as exactly 1/n{\displaystyle

Brams–Taylor procedure (734 words) [view diff] exact match in snippet view article find links to article

division of the entire cake. Brams–Taylor–Zwicker procedure – a moving-knife procedure for 4 partners, which uses a finite number of cuts. Envy-free cake-cutting

Online fair division (3,318 words) [view diff] exact match in snippet view article find links to article

division procedures like divide and choose and the Dubins-Spanier moving-knife procedure can be adapted to this setting. They guarantee online variants of

Envy-free cake-cutting (5,490 words) [view diff] exact match in snippet view article find links to article

cake is an interval there will be four pieces); Using the Austin moving-knife procedure for two partners, it is possible to get an envy-free division for