Welcome to GTNash’s documentation!

• Introduction
• gtnash Tutorial
  • 1. Normal form games
    • 1.1 Defining a NFG object
    • 1.2 Solving using Wilson’s algorithm
      • Remark
      • Returning a Nash equilibrium using Wilson’s algorithm, in one command
    • 1.3 Solving using Porter, Nudelman and Shoam’s algorithm
  • 2. Polymatrix games
    • 2.1 Definition of a polymatrix game
    • 2.2 Solving a polymatrix game using the Lemke-Howson algorithm
    • 2.3 Game conversion
  • 3. Hypergraphical games
    • 3.1 Definition of a hypergraphical game
    • 3.2 Solving a hypergraphical game, using Wilson’s algorithm
  • 4. Bayesian games and hypergraphical bayesian games
  • 5. Game files formats
• The different classes of games
  • Abstract games class
    • AbstractGame
      • AbstractGame.n_players
      • AbstractGame.players_actions
      • AbstractGame.utilities
  • Normal form games class
    • NFG
      • NFG.all_response_of_player()
      • NFG.build_subgame()
      • NFG.disutil_of_joint_action()
      • NFG.disutil_of_row()
      • NFG.error_equilibrium()
      • NFG.expected_utilities()
      • NFG.first_pne()
      • NFG.generate_joint_actions()
      • NFG.get_all_PNE()
      • NFG.get_sub_jointact_of_n()
      • NFG.get_subgame_fixed_strat()
      • NFG.get_subgame_level()
      • NFG.get_subgame_without_n()
      • NFG.is_equilibrium()
      • NFG.joint_action_except_i()
      • NFG.pne_exist()
      • NFG.readNFGoutcome()
      • NFG.readNFGpayoff()
      • NFG.read_GameFile()
      • NFG.row_where_p_is_i()
      • NFG.transform_utilities()
      • NFG.util_of_row()
      • NFG.writeNFGoutcome()
      • NFG.writeNFGpayoff()
      • NFG.write_GameFile()
  • Polymatrix games class
    • PMG
      • PMG.read_GameFile()
  • Hypergraphical games class
    • HGG
      • HGG.build_subgame()
      • HGG.convert_to_HGG()
      • HGG.convert_to_NFG()
      • HGG.expected_utilities()
      • HGG.first_pne()
      • HGG.game_as_int()
      • HGG.generate_local_normalformgame()
      • HGG.get_all_PNE()
      • HGG.get_max_value_of_player_n()
      • HGG.get_player_except_e()
      • HGG.get_player_interact()
      • HGG.get_player_interact_except_e()
      • HGG.get_subgame_fixed_strat()
      • HGG.get_subgame_level()
      • HGG.get_subgame_without_n()
      • HGG.index_of_player_in_local()
      • HGG.is_GG()
      • HGG.is_PMG()
      • HGG.is_equilibrium()
      • HGG.joint_action_except_i()
      • HGG.local_game_of_player_n()
      • HGG.pne_exist()
      • HGG.random()
      • HGG.read_GameFile()
      • HGG.simplify_subgame()
      • HGG.util_of_player()
      • HGG.write_GameFile()
  • Bayesian games class
    • BG
      • BG.conditional_probabilities()
      • BG.convert_to_HGG()
      • BG.dico_utilities()
      • BG.expected_utilities()
      • BG.generate_joint_matrix()
      • BG.generate_local_normalformgame()
      • BG.get_index_of_type()
      • BG.is_equilibrium()
      • BG.proba_type()
      • BG.random_bayesian()
      • BG.random_game()
      • BG.read_GameFile()
      • BG.write_GameFile()
  • Bayesian hypergraphical games class
    • BHGG
      • BHGG.convert_to_HGG()
      • BHGG.convert_to_NFG()
      • BHGG.expected_utilities()
      • BHGG.generate_local_bayesiangame()
      • BHGG.is_equilibrium()
      • BHGG.local_game_of_player_n()
      • BHGG.random_bayesian_hyper()
      • BHGG.read_GameFile()
      • BHGG.write_GameFile()
• The different solvers
  • Wilson’s algorithm
    • Classes
    • Module’s methods
    • Detailed description of classes and methods
    • Node
      • Node.already_visited()
      • Node.check_complementarity()
      • Node.check_degeneracy()
      • Node.compute_arc()
      • Node.descend()
      • Node.get_data_of_path()
      • Node.lift()
      • Node.normalized_strategy()
      • Node.traverse()
    • NodePathData
      • NodePathData.get_data_node_path()
      • NodePathData.get_sum_node()
      • NodePathData.get_total_node()
      • NodePathData.get_total_node_comp()
      • NodePathData.get_total_node_init()
    • WilsonError
    • first_node()
    • gen_all_omega0()
    • gen_only_omega_to_used()
    • irda_on_game()
    • proba_from_reduced_to_normal()
    • wilson()
    • wilson_loop()
  • Porter, Nudelman and Shoam’s algorithm
    • Class
    • Modules’ methods
    • Detailed description of classes and methods:
    • PNS_solver
      • PNS_solver.create_W_from_support_strat()
      • PNS_solver.create_Wb_from_support_strat()
      • PNS_solver.launch_pns()
      • PNS_solver.normalized_strategy()
      • PNS_solver.support_to_strategy()
    • allbalancedpartitions()
    • allbalancedsupports()
    • balancedpartitions()
    • pns_algo()
    • supports()
    • unbalance_partitions()
  • Howson’s algorithm
    • Class
    • Detailed description of the class:
    • LHpolymatrix
      • LHpolymatrix.block_pivot()
      • LHpolymatrix.complementary_of_p()
      • LHpolymatrix.enter_in_base()
      • LHpolymatrix.inv_util()
      • LHpolymatrix.inverse_utilities()
      • LHpolymatrix.launch_solver()
      • LHpolymatrix.lemke()
      • LHpolymatrix.max_coefEpsilon()
      • LHpolymatrix.nash_equi()
      • LHpolymatrix.pivot_row_col()
      • LHpolymatrix.switch_var_base()
      • LHpolymatrix.tucker_schema()
      • LHpolymatrix.update_var_position()
• Utilities
  • Iterated Removal of Dominated Alternatives
    • Modules’ methods
    • Detailed description of methods
    • eliminate_alternative()
    • find_dominated_alternatives()
    • irda()
    • local_difference()
    • nondominated()
    • subutilities_player()
  • Polynomial Complementarity Problems
    • Classes:
    • Detailed description of the classes
    • PolynomialComplementaryProblem
      • PolynomialComplementaryProblem.gen_var_x()
      • PolynomialComplementaryProblem.gen_var_y()
      • PolynomialComplementaryProblem.generate_Q()
      • PolynomialComplementaryProblem.generate_Q_alt()
      • PolynomialComplementaryProblem.generate_R()
      • PolynomialComplementaryProblem.generate_id_to_act()
      • PolynomialComplementaryProblem.generate_id_to_nb_act()
      • PolynomialComplementaryProblem.generate_poly()
      • PolynomialComplementaryProblem.generate_poly_y()
      • PolynomialComplementaryProblem.get_negative_utilities()
      • PolynomialComplementaryProblem.substitute()
      • PolynomialComplementaryProblem.transform_game_to_hgg()
    • Subsystem
      • Subsystem.compute_ideal()
      • Subsystem.compute_solutions()
      • Subsystem.compute_variety()
      • Subsystem.feasible_point()
      • Subsystem.generate_equations()
      • Subsystem.generate_inequations()

Indices and tables

• Index

• Module Index

• Search Page