Algorithms for static stackelberg games with linear costs and polyhedra constraints

Three algorithms for solving the static Stackelberg game with two decision makers, linear costs and polyhedra constraints are presented. The nonconvexity of the Reaction set of the Follower is a major source of difficulty in solving such problems. The algorithms presented are able to bypass this difficulty and find the solution in a finite number of iterations.