> it is in the paper mentioned later in the posting. > > http://arxiv.org/PS_cache/math/pdf/0508/0508580v2.pdf > > Ok; the result is really surprising to me; this is really great. But I remember your 95 (or 94 maybe...) paper on "sparse" approximate Nash equilibria, I know you publish surprising (and true!) results :-)
With the recent tradition of submitting crazy papers for testing reviewers, I understand that the reviewer want to double- or triple-check :-) By the way, we have a proof of a fast algorithm for finding sparse Nash equilibria (when the exact Nash is sparse), faster than the algorithm by Grigoriadis & Khachian (which finds approximate Nash equilibria in time O(KlogK/epsilon^2) for a KxK matrix game with precision epsilon. This is not so far from the "computer-Go" topic, as a funny application would be Batoo, this Korean version of Go in which both players setup some initial stones. Unfortunately, Batoo has other complicated things like the hidden stone to be played once in the game, but for fun one can consider just the part of Batoo in which both players setup some initial stones before starting the game :-) Some Batoo players or computer-players here ? Best regards, Olivier
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
