Albert Xin Jiang, Christopher Thomas Ryan, Kevin Leyton-brown
Abstract. We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact ” representations,...
A parametric integer programming algorithm for bilevel mixed integer programs (2009)
Köppe, Matthias, Queyranne, Maurice, Ryan, Christopher Thomas
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present...
Rational Generating Functions and Integer Programming Games (2008)
Köppe, Matthias, Ryan, Christopher Thomas, Queyranne, Maurice
We explore the computational complexity of computing pure Nash equilibria for a new class of strategic games called integer programming games with difference of piecewise linear convex payoffs....