Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Carlos Rafels"'
Publikováno v:
Dipòsit Digital de la UB
Universidad de Barcelona
Universidad de Barcelona
We consider a package allocation problem in which a seller owns many indivisible objects and the rest of the agents, buyers, are interested in packages of these objects. Buyers’ valuations satisfy monotonicity and the gross substitutes condition (K
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cbc9063911b10684a67338b8be1f110
https://doi.org/10.1016/j.jmateco.2019.11.002
https://doi.org/10.1016/j.jmateco.2019.11.002
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de la UB
Universidad de Barcelona
instname
Dipòsit Digital de la UB
Universidad de Barcelona
We show that the family of assignment matrices which give rise to the same nucleolus forms a compact join-semilattice with one maximal element. The above family is, in general, not a convex set, but path-connected.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96a4e0d4f3af2169cf9e0464ab9b351f
https://doi.org/10.1007/s11750-019-00498-1
https://doi.org/10.1007/s11750-019-00498-1
Autor:
Carlos Rafels, Josep M. Izquierdo
Publikováno v:
Dipòsit Digital de la UB
Universidad de Barcelona
Universidad de Barcelona
In a theoretical co-investment problem, a set of agents face a surplus-sharing situation with a single input and a single output exhibiting increasing average returns. All agents contribute their respective inputs and expect part of the collective ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0fe9fb5a9ab28feadfe9c6285950457
http://hdl.handle.net/2445/178068
http://hdl.handle.net/2445/178068
Publikováno v:
Dipòsit Digital de la UB
Universidad de Barcelona
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universidad de Barcelona
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a89418bff19af1f5b4df0fe5219447f
http://hdl.handle.net/2445/130382
http://hdl.handle.net/2445/130382