أعرض تسجيلة المادة بشكل مبسط
| dc.creator |
Martínez, Ruth |
|
| dc.creator |
Massó, Jordi |
|
| dc.creator |
Neme, Alejandro |
|
| dc.creator |
Oviedo, Jorge |
|
| dc.date |
2007-11-08T15:41:31Z |
|
| dc.date |
2007-11-08T15:41:31Z |
|
| dc.date |
2000-02 |
|
| dc.date.accessioned |
2017-01-31T00:58:15Z |
|
| dc.date.available |
2017-01-31T00:58:15Z |
|
| dc.identifier |
http://hdl.handle.net/10261/1958 |
|
| dc.identifier.uri |
http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1958 |
|
| dc.description |
The paper proposes an algorithm to compute the set of many-to-many stable matchings when agents have substitutable preferences. The algorithm starts by calculating the two optimal-stable matchings using the
deferred-acceptance algorithm. Then, it computes each remaining stable matching as the firm-optimal stable matching corresponding to a new preference
profile which is obtained after modifying the preferences of a previously
identified sequence of firms. |
|
| dc.description |
Financial support through a grant from the Programa de Cooperación Científica Iberoamericana is acknowledged.
The work of J. Massó is also partially supported by Research Grants PB98-0870 from the Dirección General de Investigación Científica y Técnica, Spanish Ministry of Education and Culture, and SGR98-62 from the Comissionat per Universitats i Recerca de la Generalitat de Catalunya. |
|
| dc.description |
Peer reviewed |
|
| dc.language |
eng |
|
| dc.relation |
UFAE and IAE Working Papers |
|
| dc.relation |
457.00 |
|
| dc.rights |
openAccess |
|
| dc.title |
An Algorithm To Compute The Set Of Many-To-Many Stable Matchings |
|
| dc.type |
Documento de trabajo |
|
الملفات في هذه المادة
|
لا توجد أي ملفات مرتبطة بهذه المادة.
|
هذه المادة تبدو في المجموعات التالية:
أعرض تسجيلة المادة بشكل مبسط