Talk:Envy-free cake-cutting

Envy-free cake-cutting was nominated as a Engineering and technology good article, but it did not meet the good article criteria at the time (November 16, 2016). There are suggestions on the review page for improving the article. If you can improve it, please do; it may then be renominated.

Rated article

I've rated this article as C-class, since it's pretty well-developed (although not every part has been cited enough, the text is very technical, and there aren't illustrations). In terms of importance, envy-free cake-cutting is somewhat important as it's about finding good cuts from only expressed preferences, which a priori seems fairly implausible (and so is a beautiful exposition of the power of modern mathematics). Please review; thanks. Duckmather (talk) 14:57, 28 April 2021 (UTC)[reply]

update

In this video Mackenzie's wife claims the problem has been solved:

What's the Fairest Way to Cut a Cake?

CapnZapp (talk) 14:11, 11 January 2024 (UTC)[reply]

Update is not needed. The paper cited in the linked youtube video [1] is from 2016 and was already cited in the article when you added the maintenance tag. See at the end of short history section:

The problem was finally solved in 2016. Haris Aziz and Simon Mackenzie presented a discrete envy-free protocol that requires at most $n^{n^{n^{n^{n^{n}}}}}$ or $n\uparrow \uparrow 6$ queries. There is still a very large gap between the lower bound and the procedure. As of October 2024, the exact run-time complexity of envy-freeness is still unknown.

Slovborg (talk) 00:33, 18 December 2024 (UTC)[reply]