Finding Nash equilibria of bimatrix games
This thesis concerns the computational problem of finding one Nash equilibrium of a bimatrix game, a two-player game in strategic form. Bimatrix games are among the most basic models in non-cooperative game theory, and finding a Nash equilibrium is important for their analysis. The Lemke—Howson algo...
| Main Author: | |
|---|---|
| Published: |
London School of Economics and Political Science (University of London)
2006
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435061 |