Amb motiu del tancament d'estiu, la validació de documents es reprendrà a partir del 28 d'agost de 2026. Disculpeu les molèsties.
Con motivo del cierre de verano, la validación de documentos se reanudará a partir del 28 de agosto de 2026. Disculpad las molestias
Due to the summer closure, document validation will resume starting August 28, 2026. We apologize for any inconvenience.

Tipus de document

Document de treball

Data de publicació

Llicència de publicació

cc-by-nc-nd, (c) Ata et al., 2017
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.

Citació

Citació

ATAY, Ata and NÚÑEZ, Marina (Núñez Oliva). Multi-sided assignment games on m-partite graphs [WP]. UB Economics – Working Papers. 2017. Vol.  E17/357. ISSN 1136-8365. [consulted: 3 of August of 2026]. Available at: https://hdl.handle.net/2445/106002

Exportar metadades

JSON - METS

Compartir registre