Showing 1 - 1 of 1
In this paper an algorithm is presented to compute all Nash equilibria for games in normal form on the only premises that the number of Nash equilibria is finite. The algorithm relies on decomposing the game by means of support-sets. For each support-set, the set of totally mixed equilibria of...
Persistent link: https://www.econbiz.de/10005209954