capture net install http://nicolaorsini.altervista.org/stata/gamet which gamet help gamet * DOMINANT AND DOMINATED STRATEGIES gamet , payoff(2, 2, 0, 1 \ 3, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(Provider) ls2(Customer) domist * ITERATED ELIMINATION OF STRONGLY DOMINATED STRATEGIES gamet, payoff(0, 0, 12, 8, 18, 9, 36, 0\ 8, 12, 16, 16, 20, 15, 32, 0 \ 9, 18, 15, 20, 18, 18, 27, 0\0, 36, 0, 32, 0, 27, 0, 0) /// player1(H M L N) player2(h m l n) ls1(Firm_I) ls2(Firm_II) elids * NASH EQUILIBRIM IN PURE STRATEGIES gamet , payoff(2, 2, 0, 1 \ 3, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(Provider) ls2(Customer) domist neps * NASH EQUILIBRIM IN MIXED STRATEGIES gamet , payoff(2, 2, 0, 1 \ 3, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(Provider) ls2(Customer) neps gamet, pay(0, 0, -10, 10 \ -1, 0, -6, -90) player1(Not_inspect Inspect) player2(Comply Cheat) ls1(I) ls2(II) nefms * GAME TREE - BACKWARD INDUCTION gamet , payoff(2, 2, 0, 1 \ 3, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(Provider) ls2(Customer) gtree gamet, payoff(2, 2, 0, 1 \ 3, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(I) ls2(II) gtree /// plotregion(color(yellow)) graphregion(color(yellow)) note(Change layout as much as you like) texts(large) /// msizes(*12) mlabpp1(9) title(Quality choice example) subtitle(I moves first) gamet, payoff(0, 0, 12, 8, 18, 9, 36, 0\ 8, 12, 16, 16, 20, 15, 32, 0 \ 9, 18, 15, 20, 18, 18, 27, 0\0, 36, 0, 32, 0, 27, 0, 0) /// player1(H M L N) player2(h m l n) ls1(Firm_I) ls2(Firm_II) gtree title(Extensive form) * MAXIMIN FOR ZERO-SUM GAME gamet, payoff(-5, 5, 3, -3, 1, -1, 20, -20\5, -5, 5, -5, 4, -4, 6, -6\ -4, 4, 6, -6, 0, 0, -5, 5) /// player1(1 2 3) player2(1 2 3 4) maximin * EXAMPLES * example from http://www.cdam.lse.ac.uk/Reports/Files/cdam-2001-09.pdf gamet, payoff(2, 2, 0, 1 \ 3, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(Provider) ls2(Customer) elids neps gamet, payoff(2, 2, 0, 1 \ 1, 0 , 1, 1) player1(High Low) player2(Buy Not_buy) ls1(Provider) ls2(Customer) elids neps gamet, pay(0, 0, -10, 10 \ -1, 0, -6, -90) player1(Not_inspect Inspect) player2(Comply Cheat) ls1(I) ls2(II) nefms gamet, payoff(-10,5, 8,-10\3, -1, 0,0) ls1(Iran) ls2(IAEA) player1(Make_nukes No_nukes) player2(Inspect Not_inspect) nefms gamet, pay(50, 50, 80, 20 \ 90, 10, 20 , 80) ls1(Serena) ls2(Venus) player1(DL CC) player2(DL CC) nefms gamet , pay(-1, -1, 3, 0 \ 0, 3, 0, 0) neps nefms elids gamet , pay(-1, -1, 4, 0 \ 0, 3, 0, 0) neps nefms ls1(MD) ls2(DK) player1(E D) player2(E D) elids * examples from http://www.courses.fas.harvard.edu/~ec1052/lecture/lecture5.pdf gamet, pay(1, 1, 0, 4 \ 0, 2, 2 , 1) neps nefms ls1(player1) ls2(player2) player1(U D) player2(L R) elids gamet , pay(1, 1, 0, 2,0,4 \0,2,5,0,1,6 \0,2,1,1,2,1) player1(U M D) player2(L C R) elids gamet , pay(1, 1, 0, 2,0,4 \0,2,5,0,1,6 \0,2,1,1,2,1) player1(U M D) player2(L C R) elids * examples from http://web.mit.edu/14.12/www/02F_lecture102.pdf gamet, pay(-1, -1, 1, -10\ -10, 1, 2, 2) player1(C D) player2(C D) elids neps nefms * examples from http://web.mit.edu/14.12/www/02F_slides5_602.pdf (there is a range) * gamet, pay(2, 2, 4, 0 \0, 4, 5, 0) player1(Rabbit Stang) player2(Rabbit Stang) elids neps nefms * examples from http://www.virtualperfection.com/gametheory/3.1.Nash%20Equilibrium.1.0.pdf gamet, payoff(9,9,0,8 \ 8,0,7,7) player1(U D) player2(l r) elids neps nefms gamet, payoff(2,1,0,0 \ 0,0,1,2) player1(U D) player2(l r) elids neps nefms * examples from http://www.virtualperfection.com/gametheory/3.2.NashEq2x2NormalFormGames.1.0.pdf gamet, payoff(1,-1,3,0 \ 4,2 ,0,-1) player1(U D) player2(l r) ls1(A) ls2(B) elids neps nefms gamet, payoff(1,1.5,3,1 \ 4,2 ,3,3) player1(U D) player2(l r) ls1(A) ls2(B) elids neps nefms * examples from http://levine.sscnet.ucla.edu/econ201/game.pdf gamet, payoff(1,1,0,0 \ 0,0,1,1) player1(U D) player2(l r) ls1(A) ls2(B) elids neps nefms gamet, payoff(2,2,-10,0 \ 0,-10,1,1) player1(U D) player2(l r) ls1(A) ls2(B) elids neps nefms gamet, payoff(6,6,2,7 \ 7,2,0,0) player1(U D) player2(l r) ls1(A) ls2(B) elids neps nefms * examples from http://www.polisci.ucsd.edu/~bslantch/courses/gt/problem-sets/w0403s.pdf gamet, payoff(2,2,1,3\ 3,1,0,0) ls1(Player1) ls2(Player2) player1(D H) player2(D H) elids neps nefms gamet, payoff(1,1,0,0\ 0,0,1,1) ls1(Player1) ls2(Player2) player1(Bridge Barn) player2(Bridge Barn) elids neps nefms gamet, payoff(1,1,0,0\ 0,0,2,2) ls1(Player1) ls2(Player2) player1(Bridge Barn) player2(Bridge Barn) elids neps nefms gamet, payoff(0,1,1,0\ 1,0,0,1) ls1(Player1) ls2(Player2) player1(A B) player2(A B) elids neps nefms gamet, payoff(1,-1,3,0\ 4,2,0,-1) ls1(Player1) ls2(Player2) player1(D H) player2(D H) elids neps nefms gamet, payoff(0,0,1,0\ 0,1,3,3) ls1(Player1) ls2(Player2) player1(D H) player2(D H) elids neps nefms * examples from http://www.andrew.cmu.edu/user/xinming/gametheory/ * gamet, pay(-1,-1, -9,0 \ 0, -9, -6,-6) ls1(Prisoner1) ls2(Prisoner2) player1(mum confess) player2(mum confess) elids neps nefms gamet, pay(-1,1,1,-1\1,-1,-1,1) player1(Head Tail) player2(Head Tail) elids neps nefms gamet, pay(2, 1, 0, 0 \ 0,0, 1, 2) ls1(Chris) ls2(Pat) player1(Opera Prize_Fight) player2(Opera Prize_Fight) elids neps nefms gamet, pay(50, 90, 50, 100 \0, -10, 100, -100) ls1(Employee) ls2(Manager) player1(Work Shirk) player2(Monitor Not_monitor) elids neps nefms gamet, pay(6,4,2,6 \3,3,6,1) ls1(Player1) ls2(Player2) player1(T B) player2(L R) elids neps nefms * Prisoner's dilemma gamet , payoff(-5, -5, 0 , -6 \ -6, 0 , -1, -1) player1(Confess Not_confess) player2(Confess Not_confess) domist neps gamet, payoff(3, 3, 0, 5 \ 5, 0 , 1, 1) player1(C D) player2(C D) ls1(Provider) ls2(Customer) domist neps gamet, payoff(-3, -3, 0, -5 \ -5, 0 , -1, -1) player1(C D) player2(C D) domist neps gamet, payoff(-10,5, 8,-10\3, -1, 0,0) ls1(Player_1) ls2(Player_2) player1(Up Down) player2(Left Right) elids neps nefms gamet , payoff(5, 5, 0 , 6 \ 6, 0 , 1, 1) player1(Confess Not_confess) player2(Confess Not_confess) domist neps