Finding a minimum-regret many-to-many stable matching

dc.contributor.author	Ειρηνάκης, Παύλος	el
dc.contributor.author	Μάγος, Δημήτριος	el
dc.contributor.author	Μούρτος, Ιωάννης	el
dc.contributor.author	Μηλιώτης, Παναγιώτης	el
dc.date.accessioned	2015-06-11T01:10:02Z
dc.date.issued	2015-06-11
dc.identifier.uri	http://hdl.handle.net/11400/15677
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	www.taylorandfrancis.com	en
dc.subject	Ευσταθές ταίριασμα
dc.subject	Διανεμητικό πλέγμα
dc.subject	Distributive lattice
dc.title	Finding a minimum-regret many-to-many stable matching	en
heal.type	journalArticle
heal.classification	Technology
heal.classification	Computer programming ( URL: http://skos.um.es/unescothes/C00749)
heal.classification	Τεχνολογία
heal.classification	Προγραμματισμός
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85133147
heal.classificationURI	N/A-Computer programming (URL: http://skos.um.es/unescothes/C00749)
heal.classificationURI	N/A-Τεχνολογία
heal.classificationURI	N/A-Προγραμματισμός
heal.identifier.secondary	DOI: 10.1080/02331934.2012.690154
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.publicationDate	2013
heal.bibliographicCitation	Eirinakis, P., Magos, D., Mourtos, I. and Miliotis, P. (2013) Finding a minimum-regret many-to-many Stable Matching. "Optimization", 62, (8), p.1007-1018	en
heal.abstract	The many-to-many Stable Matching (MM) problem is defined on a set of workers and a set of firms and asks for an allocation of workers to firms that satisfies the firms' quotas and the preferences of workers for firms and vice-versa. This article proposes a time-optimal algorithm for solving the minimum-regret problem for the MM, i.e. the problem of finding the MM solution in which the agent that is least well off is matched with the best possible set of agents of the opposite set. The proposed algorithm utilizes the notion of rotations and extends an analogous result for the Stable Marriage problem.	en
heal.journalName	Optimization	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	false