Solving Becker's assortative assignments and extensions

dc.contributor.author
Martínez de Albéniz, F. Javier
dc.contributor.author
Rafels, Carles
dc.contributor.author
Ybern, Neus
dc.date.issued
2018-05-30T09:29:07Z
dc.date.issued
2018-05-30T09:29:07Z
dc.date.issued
2018
dc.identifier
https://hdl.handle.net/2445/122644
dc.description.abstract
We analyze assortative assignment games, introduced in Becker (1973) and Eriksson et al. (2000). We study the extreme core points and show an easy way to compute them. We find a natural solution for these games. It coincides with several well-known point solutions, the median stable utility solution (Schwarz and Yenmez, 2011) and the nucleolus (Schmeidler, 1969).We also analyze the behavior of the Shapley value. We finish with some extensions, where some hypotheses are relaxed.
dc.format
36 p.
dc.format
application/pdf
dc.language
eng
dc.publisher
Universitat de Barcelona. Facultat d'Economia i Empresa
dc.relation
UB Economics – Working Papers, 2018, E18/376
dc.relation
[WP E-Eco18/376]
dc.rights
cc-by-nc-nd, (c) Martínez de Albéniz et al., 2018
dc.rights
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights
info:eu-repo/semantics/openAccess
dc.source
UB Economics – Working Papers [ERE]
dc.subject
Teoria de jocs
dc.subject
Teoria de conjunts
dc.subject
Lògica matemàtica
dc.subject
Game theory
dc.subject
Set theory
dc.subject
Mathematical logic
dc.title
Solving Becker's assortative assignments and extensions
dc.type
info:eu-repo/semantics/workingPaper


Files in this item

FilesSizeFormatView

There are no files associated with this item.