The purpose of this paper is twofold: First, to present an approach and a solution for analyzing the stability of coalition structures: We define a coalitional system (a set and a binary relation on that set) that explains the transitions between coalition structures and we propose to solve...

In this paper we present a solution concept for abstract systems called the admissible hierarchic set. The solution we propose is a refinement of the hierarchic solution, a generalization of the von Neumann and Morgenstern solution. For finite abstract systems we show that the admissible...

We introduce a new variation of the hawk-dove game suggested by an experiment that studies the behavior of a group of domestic fowls when a subgroup has been marked. Speci cally we consider a population formed by two types of individual that fail to recog- nize their own type but do recognize...

The aim of this paper is to propose a new solution for the roommate problem with strict preferences. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2])and maximum stable matchings (Ta [30] [32]). We find that almost stable matchings are...

We assume that 2 x 2 matrix games are publicly known and that players perceive a dichotomous characteristic on their opponents which defines two types for each player. In turn, each type has beliefs concerning her opponent's types, and payoffs are assumed to be type-independent. We analyze...

We analyze the von Neumann and Morgenstern stable sets for the mixed extension of 2 2 games when only single profitable deviations are allowed. We show that the games without a strict Nash equilibrium have a unique vN&M stable set and otherwise they have infinite sets.

We study the supercore of a system derived from a normal form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore of that system coincides with the set of Nash equilibrium strategy profiles of the last game in the sequence. This...

This paper provides a noncooperative understanding of the nucleolus and the egalitarian allocation for airport cost problems. We find that every Nash equilibrium of the noncooperative game has the nucleolus as outcome while the egalitarian allocation is just one of the Nash outcomes.

The lack of stability in some matching problems suggests that alternative solution concepts to the core might be applied to find predictable matchings. We propose the absorbing sets as a solution for the class of roommate problems with strict preferences. This solution, which always exists,...