Carles Rafels

Learn More
The existence of von Neumann–Morgenstern solutions (stable sets) for bilateral assignment markets is an unsolved question since Shapley and Shubik (1972). In 1984 Shubik proposed to consider, for each optimal matching, the union of the core of the game and the core of the subgames that are compatible with this matching. We prove in the present paper that(More)
Although assignment games are hardly ever convex, in this paper a characterization of their set of extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his(More)