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...

Theories of equilibrium selection in non-cooperative games, as well as the notion of risk dominance, depend heavily on the so-called linear tracing procedure. This is the first paper to give direct, simple proofs of the feasibility of the linear tracing procedure. The first proof utilizes a...

We revisit n-player coordination games with Pareto-ranked Nash equilibria. As a novelty, we introduce fuzzy play and a matching device. By fuzzy play we mean that each player does not choose which pure strategy to play, but instead chooses a nonempty subset of his strategy set that he submits to...

The paper addresses the following question: how efficient is the market system in allocating resources if trade takes place at prices that are not competitive? Even though there are many partial answers to this question, an answer that stands comparison to the rigor by which the first and second...