1 paper · 1 filter
Lisa Hellerstein, Thomas Lidbetter, Daniel Pirutinsky
We present efficient algorithms for computing optimal or approximately optimal strategies in a zero-sum game for which Player I has n pure strategies and Player II has an arbitrary…