Equilibrium Solutions of Two-Person Non-Zero-Sum Games in Extensive Form and the Corresponding Quadratic Programming Problems
Ichiro NISHIZAKI, Hideki KATAGIRI, Takuma NOTSU
This paper deals with two types of two-person non-zero-sum games in extensive form. We formulate quadratic programming problems whose decision variables correspond to behavioral strategies of players and show that optimal solutions to the formulated problems are equilibrium solutions of the games. We give two examples and demonstrate how to obtain equilibrium solutions by using the relation between the equilibrium solutions and the quadratic programming problems.