3 ms·
This algorithm is not new - it is well known in fact. The issue with it is that it's continuous-time. For example, you can't run your algorithm on a Turing mach
by nightcracker 8y ago
This algorithm is not new - it is well known in fact. The issue with it is that it's continuous-time. For example, you can't run your algorithm on a Turing machine.
The real problem was to find an algorithm that runs in a finite number of discrete steps.
- waqf 8y agoAlso, it's not envy-free. Say n=3: A might accept (in their opinion) 1/3 of the cake, but then watch as B and C divide the cake (in A's opinion) unevenly, so that (in A's opinion) either B or C has taken more than 1/3 and A is envious.