Ten million 3-by-3 strategic games, with Nash Equilibria and Perfectly Transparent Equilibrium pre-computed

Published: 12-05-2020| Version 2 | DOI: 10.17632/xynvvrjvrv.2
Contributors:
Ghislain Fourny,
Felipe Sulser

Description

The games were automatically generated by taking random payoff permutations on the integers 0-8 for each game and agent. It is thus a simple random sample with replacement. The game matrix is in field y. The Nash equilibrium (field N) and the Perfectly Transparent Equilibrium (field P) are pre-computed. Important: the equilibrium fields contain the coordinates (starting at 0) of the equilibria in the matrix in field y, not the payoffs. There are 800 files, so that it is easy for consumers to only work on a subset to get a smaller sample.

Files

Steps to reproduce

The code used for the generation is available at https://github.com/FelipeSulser/NonNashianGameTheory