Taking inspiration from well-established frameworks in the context of Mixed Integer Programming, we devise an outer approximation to compute equilibria a large class of games. We aim to use some of the algorithmic ideas MIP and revise them for equilibria computation. From a high-level perspective, the OA algorithm iteratively refines each of the leaders' feasible regions, and separate constraints thanks to a new equilibrium oracle.
Stay tuned! :-)
While waiting for the latest Oracle's computational results, I found out I could have "optimized" my time by playing with Logic Pro X.