Reputation
625
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
3 4
Newest
 Yearling
Impact
~4k people reached

Aug
18
comment Find a Nash equilibrium solver
Then you can and should use exact arithmetic. Gambit should be fine. Gambit can use lrslis with the -L flag, but I am not sure who widely tested this is. Any problems, then you could also use lrs directly, see cgm.cs.mcgill.ca/~avis/C/lrslib/USERGUIDE.html#nash and this other answer here: math.stackexchange.com/questions/881906/…
Aug
17
revised Find a Nash equilibrium solver
deleted 1 character in body
Aug
17
comment Find a Nash equilibrium solver
Python is certainly a good choice, especially with Gambit. How many players do your games have?
Aug
16
answered Find a Nash equilibrium solver
Jul
22
awarded  Yearling
Jun
25
revised Can mixed strategies outperform pure strategies?
added 10 characters in body
Jun
25
answered Can mixed strategies outperform pure strategies?
Jun
1
answered Question about Game theory, matrix games.
Apr
8
revised show no equilibrium pairs exist in a non cooperative game using pay-off set?
added 1 character in body
Apr
8
revised show no equilibrium pairs exist in a non cooperative game using pay-off set?
added 15 characters in body
Apr
8
answered show no equilibrium pairs exist in a non cooperative game using pay-off set?
Apr
4
comment I can't find the Nash equilibrium of this 3x2 game.
Forget the equations for a minute and think about why Henry's answer is correct. Remember: a Nash equilibrium is a pair of mutual best responses. Equivalently, a pair of mixed strategies are an equilibrium if and only if all pure strategies played with positive probability are best responses. If player 2 mixed uniformly then player 1 gets 0 from the bottom two rows and (always) gets $a>0$ from the two top. Against the top row, player 2 is indifferent (so any mixture is a best response). Thus this is an equilibrium. Use banach.lse.ac.uk to solve games and refine your intuition.
Mar
15
revised What is the story behind ${n+1 \choose k} = {n \choose k} + {n \choose k-1}$?
added 5 characters in body
Mar
15
answered What is the story behind ${n+1 \choose k} = {n \choose k} + {n \choose k-1}$?
Feb
20
revised Lemke-Howson pivoting in degenerate bimatrix games
added 9 characters in body
Feb
18
answered Lemke-Howson pivoting in degenerate bimatrix games
Feb
5
answered Mixed Nash equilibrium in two players game three stategies
Jan
21
answered Calculating Nash equilibrium in mixed strategy in a game where a Nash equilibrium in pure strategy exists
Jan
21
awarded  Yearling
Nov
20
revised How can I tell if a two-person game is non-degenerate, given its payoff matrices?
added 37 characters in body