The paper considers a one-to-one matching with contracts model in the presence of price controls. This set-up contains two important streams in the matching literature, those with and those without monetary transfers, as special cases and allows for intermediate cases with some restrictions on...

In this paper we generalize the concept of coalitional games by allowingfor any organizational structure within coalitions represented by a graphon the set of players ot the coalition. A, possibly empty, set of payoffvectors is assigned to any graph on every subset of players. Such a gamewill be...

In a standard general equilibrium model it is assumed that there are no price restictionsand that prices adjust infinitely fast to their equilibrium values. In this paper the set ofadmissible prices is allowed to be an arbitrary convex set. For such an arbitrary set it cannotbe guaranteed that...

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

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

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 cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure...

We analyze the simplest Condorcet cycle with three players and three alternatives within a strategic bargaining model with recognition probabilities and costless delay. Mixed consistent subgame perfect equilibria exist whenever the geometric mean of the agents' risk coefficients, ratios of...

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