In this paper, we investigate the possibility of having stable rules for two-sided markets with transferable utility, that satisfy some valuation monotonicity and fairness axioms. Valuation fairness requires that changing the valuation of a buyer for the object of a seller leads to equal changes...

In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in this case, we first focus on other notions of stability such as the notions of subsolution and von Neumann-Morgenstern stable sets. The dominant diagonal property is necessary...

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We...

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We...

We consider a multi-sided assignment game with the following characteristics: (a) the agents are organized in m sectors that are connected by a graph that induces a weighted m-partite graph on the set of agents, (b) a basic coalition is formed by agents from different connected sectors, and (c)...

In this paper, we investigate the possibility of having stable rules for two-sided markets with transferable utility, that satisfy some valuation monotonicity and fairness axioms. Valuation fairness requires that changing the valuation of a buyer for the object of a seller leads to equal changes...