We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

We show that in the canonical non-cooperative multilateral bargaining game, a subgame perfect equilibrium exists in pure stationary strategies, even when the space of feasible payoffs is not convex. At such an equilibrium there is no delay. We also have the converse result that randomization...

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

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players. The social structure is utilized to refine the core of the game. For every coalition the relative strength of a player within that coalition is induced by the...

We study stable sets for marriage problems under the assumption that players can be both myopic and farsighted. We introduce the new notion of the myopic-farsighted stable set. For the special cases where all players are myopic and where all players are farsighted, our concept predicts the set...

This discussion paper led to a publication in 'Social Choice and Welfare', 2005, 24, 439-454.<P> Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe...</p>

This discussion paper resulted in a publication in 'Games and Economic Behavior', 2007, 59, 85-104. <P> We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players. The social structure is utilized to refine the core of the...</p>

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 consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players. The social structure is utilized to refine the core of the game. For every coalition the relative strength of a player within that coalition is induced by the...

A set of coalition structures <em>P</em> is farsightedly stable (i) if all possible deviations from any coalition structure p belonging to <em>P</em> to a coalition structure outside <em>P</em> are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improvingpath from any...