News for hackers. Stuff that matters.

A comment on A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents.

Re:A Discrete and Bounded Envy-Free Cake Cutting Protocol fo... by nomilk on Saturday January 20, 2024 @08:59PM (#39074732)
> The maximum number of queries required by the protocol is n^n^n^n^n^n

I'm impressed that rendered correctly, never seen that before. Got a minimal version working:

code: https://pastebin.com/CqCzH8H7

what it looks like: https://imgur.com/a/v2PU1mH

[ Parent | on HN ]
Re:A Discrete and Bounded Envy-Free Cake Cutting Protocol fo... by matt-tingen on Saturday January 20, 2024 @09:49PM (#39075035)
Or with MathML: https://jsfiddle.net/31ug4kdw/
[ Parent | on HN ]
Re:A Discrete and Bounded Envy-Free Cake Cutting Protocol fo... by nomilk on Sunday January 21, 2024 @01:23AM (#39076124)
I've somehow never come across <math> before. TIL! Thanks for sharing
[ Parent | on HN ]