The literature on the computation of Nash equilibria in n-person games is dominated by simplicial methods. This paper is the first to introduce a globally convergent algorithm that fully exploits the differentiability present in the problem. It presents an everywhere differentiable homotopy to...

The implausibility of the extreme rationality assumptions of Nash equilibrium has been attested by numerous experimental studies with human players. In particular, the fundamental social dilemmas such as the Traveler's dilemma, the Prisoner's dilemma, and the Public Goods game demonstrate high...