Please use this identifier to cite or link to this item:
Title: Multi-sided assignment games on m-partite graphs
Author: Ata Atay
Núñez, Marina (Núñez Oliva)
Keywords: Jocs cooperatius (Matemàtica)
Assignació de recursos
Equilibri (Economia)
Cooperative games (Mathematics)
Resource allocation
Equilibrium (Economics)
Issue Date: 2017
Publisher: Universitat de Barcelona. Facultat d'Economia i Empresa
Series/Report no: [WP E-Eco17/357]
Abstract: 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.
It is part of: UB Economics – Working Papers, 2017, E17/357
ISSN: 1136-8365
Appears in Collections:UB Economics – Working Papers [ERE]

Files in This Item:
File Description SizeFormat 
E17-357_Atay_MultiSided.pdf449.64 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons