Different solution concepts (core, stable sets, largest consistent set, ...) can be defined using either a direct or an indirect dominance relation. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct) or farsighted...

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 extend Jackson and Watts's (2002) result on the coincidence of S-stochastically stable and core stable networks from marriage problems to roommate problems. In particular, we show that the existence of a side-optimal core stable network, on which the proof of Jackson and Watts (2002, Theorem...

This paper strengthens the result of Sengupta and Sengupta (1996). We show that for the class of games with nonempty cores the core can be reached in a bounded number of proposals and counterproposals. Our result is more general than this: the boundedness holds for any two imputations with an...

A set of outcomes for a TU-game in characteristic function form is dominant if it is, with respect to an outsider-independent dominance relation, accessible (or admis-sible) and closed. This outsider- independent dominance relation is restrictive in the sense that a deviating coalition cannot...

We apply farsighted stable set to two versions of Hotelling's location games: one with linear market and another with circular market. It is shown that there always exists a farsighted stable set in both games. In particular, the set of all location profiles that yields equal payoff across all...

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

This paper considers a fair division problem with indivisible objects, like jobs, houses, positions, etc., and one divisible good (money). The individuals consume money and one object each. The class of fair allocation rules that are strategy-proof in the strong sense that no coalition of...

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms or order p4 for...

The authors develop a two-stage negotiation model to study the impact of costly inspections on both the coalition formation outcome and the per-member payoffs.