Bimatrix Stackelberg

Optimal strategies for a bimatrix Stackelberg game

BIMATRIXSTACKELBERG finds optimal strategies for the leader and follower in a bimatrix Stackelberg game and the associated payoffs. It implements the algorithm described in Theorem 2 of V Conitzer, T Sandholm, "Computing the Optimal Strategy to Commit to", EC’06, Proceedings of the 7th ACM conference on electronic commerce, June 11–15, 2006, Ann Arbor, Michigan, USA, pages 82 - 90.