DocumentCode
522883
Title
A New Method for Solving Bimatrix Games Problems
Author
Yong, Longquan
Author_Institution
Dept. of Math., Shaanxi Univ. of Technol., Hanzhong, China
Volume
3
fYear
2010
fDate
4-6 June 2010
Firstpage
3
Lastpage
5
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;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/ICIC.2010.183
Filename
5513905
Link To Document