TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)

24 pointsby luuover 1 year ago

3 comments

RcouF1uZ4gsCover 1 year ago
&gt; The maximum number of queries required by the protocol is n^n^n^n^n^n<p>With 2 people taking 1 second per query you end up with 2^2^2^2^2^2 which is 2^(2^65536) seconds.<p>I guess if not only the cake has decomposed and the people involved have died, but the universe itself has lost all thermodynamic free energy, I guess technically we are in an envy free state.
评论 #39075725 未加载
评论 #39075876 未加载
nomilkover 1 year ago
&gt; The maximum number of queries required by the protocol is n^n^n^n^n^n<p>I&#x27;m impressed that rendered correctly, never seen that before. Got a minimal version working:<p>code: <a href="https:&#x2F;&#x2F;pastebin.com&#x2F;CqCzH8H7" rel="nofollow">https:&#x2F;&#x2F;pastebin.com&#x2F;CqCzH8H7</a><p>what it looks like: <a href="https:&#x2F;&#x2F;imgur.com&#x2F;a&#x2F;v2PU1mH" rel="nofollow">https:&#x2F;&#x2F;imgur.com&#x2F;a&#x2F;v2PU1mH</a>
评论 #39075035 未加载
saagarjhaover 1 year ago
Suddenly my exponential time algorithms don’t seem so bad anymore.