Balanced Coalitional Matchings

Autores

  • Juan Carlos Cesco

Palavras-chave:

Concorrência - associações - troca de informações

Resumo

In this note we define a balancedness property for a particular two sided many-to-many matching problem developed by Dimitrov and Lazarova (2008), and prove that this is a necessary and sufficient condition for the existence of stable coalitional matchings, the solution concept proposed for this model in the latter reference. The proof is carried out by using some results from the theory of hedonic games. We also show that hedonic games defines an equivalence relation over the set of matching problems.

Downloads

Não há dados estatísticos.

Downloads

Publicado

2012-03-15

Edição

Seção

Artigos