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

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

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

We report new results for a time-indexed formulation of nonpreemptive single- machine scheduling problems. We give complete characterizations of all facet induc- ing inequalities with integral coecients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules,...

In many real life passenger railway networks, the types of stations and lines characterisethe halting stations of the train lines. Common types are Regional, Interregional or Intercity.This paper considers the problem of altering the halts of lines by both upgrading and downgrading stations,...

We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity among agents with single-peaked preferences and initial endowments. We propose an extension of the so-called uniform rule and show that it is the unique rule satisfying strategy-proofness, Pareto...

We consider the problem of reallocating the total initial endowments of an infinitely divisible commodity among agents with single-peaked preferences. With the uniform reallocation rule we propose a solution which satisfies many appealing properties, describing the effect of population and...