Equilibrium points of bimatrix games
CE Lemke, JT Howson, Jr - Journal of the Society for industrial and Applied …, 1964 - SIAM
CE Lemke, JT Howson, Jr
Journal of the Society for industrial and Applied Mathematics, 1964•SIAMAn algebraic proof is given of the existence of equilibrium points for bimatrix (or two-person,
non-zero-sum) games. The proof is constructive, leading to an efficient scheme for
computing an equilibrium point. In a nondegenerate case, the number of equilibrium points
is finite and odd. The proof is valid for any ordered field.
non-zero-sum) games. The proof is constructive, leading to an efficient scheme for
computing an equilibrium point. In a nondegenerate case, the number of equilibrium points
is finite and odd. The proof is valid for any ordered field.
An algebraic proof is given of the existence of equilibrium points for bimatrix (or two-person, non-zero-sum) games. The proof is constructive, leading to an efficient scheme for computing an equilibrium point. In a nondegenerate case, the number of equilibrium points is finite and odd. The proof is valid for any ordered field.