Bimatrix Equilibrium Points and Mathematical Programming
AbstractSome simple constructive proofs are given of solutions to the matric system Mz - \omega - q; z \geqq 0; \omega \geqq 0; and z T \omega - 0, for various kinds of data M, q, which embrace the quadratic programming problem and the problem of finding equilibrium points of bimatrix games. The general scheme is, assuming non-degeneracy, to generate an adjacent extreme point path leading to a solution. The scheme does not require that some functional be reduced.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 11 (1965)
Issue (Month): 7 (May)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.