Working papers // Institute of Mathematical Economics 382
In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of strategy profiles using a new variant of Sperner's Lemma for labelled triangulations of simplotopes, which we prove in this paper. Our algorithm uses a labelling derived from the satisficing function of Geanakoplos (2003) and can be used to compute approximate Nash equilibria for payoff functions that are not necessarily linear. Finally, in bimatrix games, we can compare our simplicial algorithm to the combinatorial algorithm proposed by Lemke & Howson (1964).