Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
waqf
on Nov 13, 2018
|
parent
|
context
|
favorite
| on:
New Algorithm Solves Cake-Cutting Problem (2016)
Also, 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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: