Carregant...
Tipus de document
Document de treballData de publicació
Llicència de publicació
Si us plau utilitzeu sempre aquest identificador per citar o enllaçar aquest document: https://hdl.handle.net/2445/106002
Multi-sided assignment games on m-partite graphs [WP]
Títol de la revista
Director/Tutor
ISSN de la revista
Títol del volum
Recurs relacionat
Resum
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) the worth of a basic coalition is the addition of the weights of all its pairs that belong to connected sectors. We provide a sufficient condition on the weights to guarantee balancedness of the related multi-sided assignment game. Moreover, when the graph on the sectors is cycle-free, we prove the game is strongly balanced and the core is described by means of the cores of the underlying two-sided assignment games associated with the edges of this graph. Moreover, once selected a spanning tree of the cycle-free graph on the sectors, the equivalence between core and competitive equilibria is established.
Matèries (anglès)
Citació
Citació
ATAY, Ata, NÚÑEZ, Marina (núñez oliva). Multi-sided assignment games on m-partite graphs [WP]. _UB Economics – Working Papers_. 2017. Vol. E17/357. [consulta: 7 de gener de 2026]. ISSN: 1136-8365. [Disponible a: https://hdl.handle.net/2445/106002]