English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/1958
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

An Algorithm To Compute The Set Of Many-To-Many Stable Matchings

AuthorsMartínez, Ruth; Massó, Jordi; Neme, Alejandro; Oviedo, Jorge
Issue DateFeb-2000
SeriesUFAE and IAE Working Papers
457.00
AbstractThe 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.
URIhttp://hdl.handle.net/10261/1958
Appears in Collections:(IAE) Informes y documentos de trabajo
Files in This Item:
File Description SizeFormat 
45700.pdf266 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.