Multi-sided assignment games on m-partite graphs
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...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2019 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:2445/150702 |
| Acesso em linha: | https://hdl.handle.net/2445/150702 |
| Access Level: | acceso abierto |
| Palavra-chave: | Jocs cooperatius (Matemàtica) Assignació de recursos Equilibri (Economia) Cooperative games (Mathematics) Resource allocation Equilibrium (Economics) |
| Resumo: | 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 fully described by means of the cores of the underlying two-sided assignment games associated with the edges of this graph. As a consequence, the complexity of the computation of an optimal matching is reduced and existence of optimal core allocations for each sector of the market is guaranteed. |
|---|