table of contents
other versions
- wheezy 0.42c-1+b1
- jessie 0.43-1
- jessie-backports 0.51-2~bpo8+1
- testing 0.51-2+b1
- unstable 0.51-2+b1
- experimental 0.62-1
NASH(1) | lrslib 0.42b | NASH(1) |
NAME¶
nash - find nash equilibria of two person noncooperative gamesSYNOPSIS¶
setupnash
input game1.ine game2.ine
setupnash2
input game1.ine game2.ine
nash
game1.ine game2.ine
2nash
game1.ine game2.ine
DESCRIPTION¶
All Nash equilibria (NE) for a two person noncooperative game are computed using two interleaved reverse search vertex enumeration steps. The input for the problem are two m by n matrices A,B of integers or rationals. The first player is the row player, the second is the column player. If row i and column j are played, player 1 receives Ai,j and player 2 receives Bi,j. If you have two or more cpus available run 2nash instead of nash as the order of the input games is immaterial. It runs in parallel with the games in each order. (If you use nash, the program usually runs faster if m is <= n , see below.) The easiest way to use the program nash or 2nash is to first run setupnash or ( setupnash2 see below ) on a file containing:m n matrix A matrix B
3 2 0 6 2 5 3 3 1 0 0 2 4 3
% setupnash game game1 game2
% nash game1 game2
% 2nash game1 game2
% setupnash2 game game1 game2
minimize 0 1 1 ... 1 (n entries to begiven) bound 1/r; ( note: reciprocal of r)
% nash game2 game1
SEE ALSO¶
For information on H-representation file formats, see the man page for lrslib or the lrslib user manual[2]NOTES¶
- 1.
- lrslib user manual
- 2.
- lrslib user manual
03/30/2011 | July 2009 |