Dominant-strategy-equilibrium

Displays all dominant strategy equilibria for a n-player game which takes input from a .nfg file

Language and modules

Language: python3
Modules:

• sys
• numpy
• itertools

Solution approach

The approach uses brute-force method. It iterates over each player one by one. In the i^th iteration it finds the best action s_i for all possible values of the strategy S_-i of all other players. If the interesction of s_i for all possible S_-i is null for any player then no dominant strategy equilibrium exists else atleast one exists.

Time Complexity

The complexity is O(N * A).
where N is the number of players
and A is the product of the number of actions available to each player

To run

./run <input file> <output file>

Author

Atirek Kumar
Github handle: atirek-ak