Many economic and social situations can be represented by a digraph. Both axiomatic and iterative methods to determine the strength or power of all the nodes in a digraph have been proposed in the literature. We propose a new method, where the power of a node is determined by both the number of...

Many economic and social situations can be represented by a digraph. Both axiomatic and iterative methods to determine the strength or power of all the nodes in a digraph have been proposed in the literature. We propose a new method, where the power of a node is determined by both the number of...

In this paper we prove the following fixed point theorem. Consider a non-empty bounded polyhedron P and a function ƒ : P → P such that for every x є P for which ƒ (x) ≠ x there exists δ 0 such that for all y, z є B (x, δ) ∩ P it holds that (ƒ(y)-y)2 (ƒ(z)-z) ≤ 0, where B (x, δ)...

We revisit n-player coordination games with Pareto-ranked Nash equilibria. The novelty is that we introduce fuzzy play and a matching device, where 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 matching...

In this paper the existence of unemployment is partly explained as being the result of coordination failures. It is shown that as a result of self-fulfilling pessimistic expectations, even at Walrasian prices, a continuum of equilibria results, among which an equilibrium with approximately no...

Both in game theory and in general equilibrium theory there exists a number of universally stable adjustment processes. In game theory these processes typically serve the role of selecting a Nash equilibrium. Examples are the tracing procedure of Harsanyi and Selten or the equilibrium selection...

This paper is the first to introduce an algorithm to compute stationary equilibria in stochastic games, and shows convergence of the algorithm for almost all such games. Moreover, since in general the number of stationary equilibria is overwhelming, we pay attention to the issue of equilibrium...

This paper is the first to introduce an algorithm to compute stationary equilibria in stochastic games, and shows convergence of the algorithm for almost all such games. Moreover, since in general the number of stationary equilibria is overwhelming, we pay attention to the issue of equilibrium...

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

Both in game theory and in general equilibrium theory there exists a number of universally stable adjustment processes. In game theory these processes typically serve the role of selecting a Nash equilibrium. Examples are the tracing procedure of Harsanyi and Selten or the equilibrium selection...