Merge remote-tracking branch 'origin/maint_clean_up_tests_games_py' into dev_testfixtures

Author: rahulsavani

tests/games.py

@@ -123,7 +123,7 @@ def test_outcome_index_exception_label():
         ###############################################################################
         # 1 player; reduction; generic payoffs
         (
-            games.create_reduction_one_player_generic_payoffs_efg(),
+            games.read_from_file("reduction_one_player_generic_payoffs.efg"),
             [["11", "12", "2*", "3*", "4*"]],
             [np.array(range(1, 6))],
         ),
@@ -168,7 +168,7 @@ def test_outcome_index_exception_label():
         ),
         # 2-player (zero-sum) game; reduction for both players; generic payoffs
         (
-            games.create_reduction_generic_payoffs_efg(),
+            games.read_from_file("reduction_generic_payoffs.efg"),
             [
                 ["1*1", "1*2", "211", "212", "221", "222"],
                 ["11*", "12*", "2**", "3*1", "3*2", "4**"],
@@ -210,7 +210,7 @@ def test_outcome_index_exception_label():
         ),
         # # 2-player game from GTE survey; reduction for both players; payoff ties
         (
-            games.create_reduction_both_players_payoff_ties_efg(),
+            games.read_from_file("reduction_both_players_payoff_ties_GTE_survey.efg"),
             [
                 ["1*", "2*", "31", "32", "4*"],
                 [
@@ -401,28 +401,28 @@ def test_reduced_strategic_form(
     "standard,modified",
     [
         (
-            games.create_two_player_perfect_info_win_lose_efg(),
-            games.create_two_player_perfect_info_win_lose_efg(nonterm_outcomes=True)
+            games.read_from_file("two_player_perfect_info_win_lose.efg"),
+            games.read_from_file("two_player_perfect_info_win_lose_with_nonterm_outcomes.efg")
         ),
         (
-            games.create_3_player_with_internal_outcomes_efg(),
-            games.create_3_player_with_internal_outcomes_efg(nonterm_outcomes=True)
+            games.read_from_file("3_player.efg"),
+            games.read_from_file("3_player_with_nonterm_outcomes.efg")
         ),
         (
-            games.create_chance_in_middle_efg(),
-            games.create_chance_in_middle_efg(nonterm_outcomes=True)
+            games.read_from_file("chance_in_middle.efg"),
+            games.read_from_file("chance_in_middle_with_nonterm_outcomes.efg")
         ),
         (
-            games.create_non_zero_sum_lacking_outcome_efg(),
-            games.create_non_zero_sum_lacking_outcome_efg(missing_term_outcome=True)
+            games.read_from_file("2_player_non_zero_sum.efg"),
+            games.read_from_file("2_player_non_zero_sum_missing_term_outcome.efg"),
         ),
         (
-            games.create_entry_accomodation_efg(),
-            games.create_entry_accomodation_efg(nonterm_outcomes=True)
+            games.read_from_file("entry_accommodation.efg"),
+            games.read_from_file("entry_accommodation_with_nonterm_outcomes.efg")
         ),
         (
-            games.create_three_action_internal_outcomes_efg(),
-            games.create_three_action_internal_outcomes_efg(nonterm_outcomes=True)
+            games.read_from_file("2_player_chance.efg"),
+            games.read_from_file("2_player_chance_nonterm_outcomes_and_missing_term_outcomes.efg"),
         ),
         (
             games.create_kuhn_poker_efg(),

tests/test_behav.py

@@ -0,0 +1,24 @@
+EFG 2 R "" { "1" "2" }
+""
+
+c "" 1 "" { "H" 1/2 "L" 1/2 } 0
+p "" 1 1 "" { "A" "B" "C" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 1 "1" { 1, -1 }
+t "" 2 "-1" { -1, 1 }
+p "" 2 2 "" { "X" "Y" } 0
+t "" 2 "-1" { -1, 1 }
+t "" 1 "1" { 1, -1 }
+p "" 2 3 "" { "X" "Y" } 0
+t "" 1 "1" { 1, -1 }
+t "" 5 "0" { 0, 0 }
+p "" 1 2 "" { "A" "B" "C" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 5 "0" { 0, 0 }
+t "" 1 "1" { 1, -1 }
+p "" 2 2 "" { "X" "Y" } 0
+t "" 1 "1" { 1, -1 }
+t "" 2 "-1" { -1, 1 }
+p "" 2 3 "" { "X" "Y" } 0
+t "" 2 "-1" { -1, 1 }
+t "" 1 "1" { 1, -1 }

tests/test_extensive.py

@@ -0,0 +1,24 @@
+EFG 2 R "" { "1" "2" }
+""
+
+c "" 1 "" { "H" 1/2 "L" 1/2 } 0
+p "" 1 1 "" { "A" "B" "C" } 0
+p "" 2 1 "" { "X" "Y" } 1 "1" { 1, -1 }
+t "" 0
+t "" 4 "-2" { -2, 2 }
+p "" 2 2 "" { "X" "Y" } 0
+t "" 2 "-1" { -1, 1 }
+t "" 1 "1" { 1, -1 }
+p "" 2 3 "" { "X" "Y" } 0
+t "" 1 "1" { 1, -1 }
+t "" 0
+p "" 1 2 "" { "A" "B" "C" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 0
+t "" 1 "1" { 1, -1 }
+p "" 2 2 "" { "X" "Y" } 0
+t "" 1 "1" { 1, -1 }
+t "" 2 "-1" { -1, 1 }
+p "" 2 3 "" { "X" "Y" } 2 "-1" { -1, 1 }
+t "" 0
+t "" 3 "2" { 2, -2 }

tests/test_games/2_player_chance.efg

@@ -0,0 +1,18 @@
+EFG 2 R "Non constant-sum game lacking outcome" { "1" "2" }
+""
+
+c "" 1 "" { "H" 1/2 "T" 1/2 } 0
+p "" 1 1 "" { "A" "B" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 1 "" { 2, 1 }
+t "" 2 "" { -1, 2 }
+p "" 2 1 "" { "X" "Y" } 0
+t "" 3 "" { 1, -1 }
+t "" 4 "" { 0, 0 }
+p "" 1 1 "" { "A" "B" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 5 "" { 1, 0 }
+t "" 6 "" { 0, 1 }
+p "" 2 1 "" { "X" "Y" } 0
+t "" 7 "" { -1, 1 }
+t "" 8 "" { 2, -1 }

tests/test_games/2_player_chance_nonterm_outcomes_and_missing_term_outcomes.efg

@@ -0,0 +1,18 @@
+EFG 2 R "Non constant-sum game lacking outcome" { "1" "2" }
+""
+
+c "" 1 "" { "H" 1/2 "T" 1/2 } 0
+p "" 1 1 "" { "A" "B" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 1 "" { 2, 1 }
+t "" 2 "" { -1, 2 }
+p "" 2 1 "" { "X" "Y" } 0
+t "" 3 "" { 1, -1 }
+t "" 0
+p "" 1 1 "" { "A" "B" } 0
+p "" 2 1 "" { "X" "Y" } 0
+t "" 4 "" { 1, 0 }
+t "" 5 "" { 0, 1 }
+p "" 2 1 "" { "X" "Y" } 0
+t "" 6 "" { -1, 1 }
+t "" 7 "" { 2, -1 }

tests/test_games/2_player_non_zero_sum.efg

@@ -0,0 +1,14 @@
+NFG 1 R "2x2 bimatrix game with all zero payoffs, with strategy labels" { "Joe" "Dan" }
+
+{ { "cooperate" "defect" }
+{ "defect" "defect" }
+}
+""
+
+{
+{ "" 0, 0 }
+{ "" 0, 0 }
+{ "" 0, 0 }
+{ "" 0, 0 }
+}
+1 2 3 4

tests/test_games/2_player_non_zero_sum_missing_term_outcome.efg

@@ -0,0 +1,20 @@
+NFG 1 R "2x2x2 game with 2 pure and 1 mixed equilibrium"
+{ "Player 1" "Player 2" "Player 3" } { 2 2 2 }
+"
+- This comes from a local max cut instance:
+  players {1,2,3} are nodes; edge weight{1,2} = 2; weight{1,3} = -1; weight{2,3} = 2
+- Pure strategies {a,b} encode if respective player is on left or right of the cut
+- The payoff to a player is the sum of their incident edges across the implied cut
+- Pure equilibrium iff local max cuts; in addition, uniform mixture is an equilibrium
+- Equilibrium analysis for pure profiles:
+    a a a:  0 0  0 -- Not Nash (regrets: 1, 4, 1)
+    b a a:  1 2 -1 -- Not Nash (regrets: 0, 0, 3)
+    a b a:  2 4  2 -- Nash (global max cut)
+    b b a: -1 2  1 -- Not Nash (regrets: 3, 0, 0)
+    a a b: -1 2  1 -- Not Nash (regrets: 3, 0, 0)
+    b a b:  2 4  2 -- Nash (global max cut)
+    a b b:  1 2 -1 -- Not Nash (regrets: 0, 0, 3)
+    b b b:  0 0  0 -- Not Nash (regrets: 1, 4, 1)
+"
+
+0 0 0 1 2 -1 2 4 2 -1 2 1 -1 2 1 2 4 2 1 2 -1 0 0 0