In this paper, we investigate the possibility of having stable rules for two-sided markets with transferable utility, that satisfy some valuation monotonicity and fairness axioms. Valuation fairness requires that changing the valuation of a buyer for the object of a seller leads to equal changes...

We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...

Solution concepts in social environments use either a direct or indirect dominance relationship, depending on whether it is assumed that agents are myopic or farsighted. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct)...

We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...

We develop a model of wage determination with private information, in which the union has the option to delegate the wage bargaining to either surplus-maximizing delegates or to wage-maximizing delegates (such as senior union members). We show that the wage outcome in case of surplus-maximizing...

We consider the problem of axiomatizing the Shapley value on the class of assignment games. We first show that several axiomatizations of the Shapley value on the class of all TU-games do not characterize this solution on the class of assignment games by providing alternative solutions that...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

Given any alpha in [0,1], an alpha-constant-sum game on a finite set of players, N, is a function that assigns a real number to any coalition S (being a subset of the player set N), such that the sum of the worth of the coalition S and the worth of its complementary coalition N\S is alpha times...

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