Title :
A New Method for Solving Bimatrix Games Problems
Author_Institution :
Dept. of Math., Shaanxi Univ. of Technol., Hanzhong, China
Abstract :
We present a new method for solving bimatrix games problems. Firstly, bimatrix games problem is transformed into general linear complementarity problem. Then we apply mixed integer linear programming method to linear complementarity problem. At last, we give some numerical examples to indicate that the method is feasible and effective to bimatrix games problems.
Keywords :
game theory; integer programming; linear programming; matrix algebra; bimatrix game; linear complementarity problem; mixed integer linear programming method; problem solving; Game theory; Helium; Integer linear programming; Mathematics; Minimax techniques; Mixed integer linear programming; Nash equilibrium; Quadratic programming; Vectors; Bimatrix games; linear complementarity problem; mixed integer linear programming;
Conference_Titel :
Information and Computing (ICIC), 2010 Third International Conference on
Conference_Location :
Wuxi, Jiang Su
Print_ISBN :
978-1-4244-7081-5
Electronic_ISBN :
978-1-4244-7082-2
DOI :
10.1109/ICIC.2010.183
