We characterize single-valued solutions of transferable utility cooperative games satisfying core selection and aggregate monotonicity. Fur- thermore, we show that these two properties are compatible with individual rationality, the dummy player property and the symmetry property. We nish...

In the framework of bilateral assignment games, we study the set of matrices associated with assignment markets with the same core. We state conditions on matrix entries that ensure that the related assignment games have the same core. We prove that the set of matrices leading to the same core...

We study under which conditions the core of a game involved in a convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas five player game with a unique stable set different from the core,...

A necessary condition for the coincidence of the bargaining sets dened by Shimomura (1997) and the core of a cooperative game with transferable utility is provided. To this aim, a set of payo vectors, called max-payo vectors, are introduced. This necessary condition simply checks whether these...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.