In a Stackelberg max closure game, we are given digraph whose vertices correspond to projects from which firms can choose and arcs represent precedence constraints. Some under the control of leader who sets prices in first stage while second stage, feasible subset maximum value. For single follower, leader’s problem finding revenue-maximizing be solved strongly polynomial time. this paper, focu...