Abstract: It is well known that multi-player potential game is PLS-complete.We show that constant player potential game is also PLS-complete.We also show that,there exist a constant-player potential game with some initial strategy such that it can

In the problem of partial function extension, we are given a partial function consisting of a set of $n$ points in a domain and a function value at each point.

Polynomial identity testing (PIT) is the algorithmic task of determining whether a given polynomial is identically zero.

Abstract: Assume that we have to move a load of coal from source pile A to destination pile B, both of whose shape we know, and whose capacities are identical.

Abstract : The stochastic multi-armed bandit model is a simple abstraction that has been proven useful in many different contexts in statistics and machine learning. The problem is studied in a number of settings.