[Paxinor]

@ nickaboutrisk:

i just briefly looked over the paper but what is really new about and superior about that solution?

is it correct that you trade memory that a LP Solution needs with CPU power, but you won't reach a really optimal state because it is just an approximation (of the optimum of the approximated game)?

there might be the advantage that you calculate a sequential nash equilibrium that you won't always get if you use the Koller algorithm but i don't know (just flew through the pages of your paper) but there is a paper somewhere how to correct that...

anyways it doesn't perform really better than the Koller algorithm so therefore its not really a progress?