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, bu

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.