An important open problem in the theory of TU-games is to determine whether a game has a stable core (Von Neumann-Morgenstern solution (1944)). This seems to be a rather difficult combinatorial problem. There are many sufficient conditions for core-stability. Convexity is probably the best known...

An important open problem in the theory of TU-games is to determine whether a game has a stable core (Von Neumann-Morgenstern solution (1944)). This seems to be a rather difficult combinatorial problem. There are many sufficient conditions for core-stability. Convexity is probably the best known...

The paper investigates under which additional assumptions the bargaining set, the reactive bargaining set or the semireactive bargaining set coincides with the core on the class of symmetric TU-games. Furthermore, we give an example which illustrates that the property 'the bargaining set...