News for hackers. Stuff that matters.
Re:A Partisan Solution to Partisan Gerrymandering: The Defin... by mrkeen on Friday February 02, 2024 @10:21AM (#39229603)
I believe fair cake-cutting algorithms are up there in terms of runtime complexity. O(n^n^n) or so?

It would be computationally feasible for small numbers, but not if the algorithm requires a human to try strategise and act in its own interest for every single step.

There are no comments on this comment yet.