no code implementations • 15 Jan 2014 • Talal Rahwan, Sarvapali Dyanand Ramchurn, Nicholas Robert Jennings, Andrea Giovannucci
The algorithm is anytime, and if interrupted before it would have normally terminated, it can still provide a solution that is guaranteed to be within a bound from the optimal one.
