Hacker News new | ask | show | jobs
by TophWells 4457 days ago
>In any case, John von Neumann proved a long time ago that any nonzero sum game with n players can be modeled as a zero sum game with n+1 players, where the n+1 player represents the global state. TUA is simply an implementation of this proof.

It's not quite the same, since TUA can be empty. Unless TUA's balance can be negative, or if it's infinite.