The function Game::LCP::initializeNotProcessed which initializes the set of all (exponentially many) unprocessed polyhedra is super-inefficient for even slightly large problems.
Can we have a work-around for this? For example, if we are going to use some algorithm (i.e., our inner approximation, but with the random selection of polyhedron), can we avoid using this function?
The function
Game::LCP::initializeNotProcessed
which initializes the set of all (exponentially many) unprocessed polyhedra is super-inefficient for even slightly large problems.Can we have a work-around for this? For example, if we are going to use some algorithm (i.e., our inner approximation, but with the random selection of polyhedron), can we avoid using this function?