no code implementations • 16 Jan 2014 • Michael Benisch, George B. Davis, Tuomas Sandholm
This algorithm serves as a subroutine in a series of polynomial-time algorithms for finding all minimal CURB sets, one minimal CURB set, and the smallest minimal CURB set in a game.
