Blockers and antiblockers of stable matchings

dc.contributor.author	Ειρηνάκης, Παύλος	el
dc.contributor.author	Μάγος, Δημήτριος	el
dc.contributor.author	Μούρτος, Ιωάννης	el
dc.date.accessioned	2015-06-10T15:55:21Z
dc.date.available	2015-06-10T15:55:21Z
dc.date.issued	2015-06-10
dc.identifier.uri	http://hdl.handle.net/11400/15645
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://www.sciencedirect.com/science/article/pii/S0304397513009298	en
dc.subject	Πολυωνυμικός αλγόριθμος
dc.subject	Γραμμική περιγραφή
dc.subject	Ταιριάσματα
dc.subject	Πολύτοπα
dc.subject	Ευσταθές ταίριασμα
dc.subject	Polynomial algorithm
dc.subject	Linear description
dc.subject	Matchings
dc.subject	Polytopes
dc.subject	Stable matching
dc.title	Blockers and antiblockers of stable matchings	en
heal.type	journalArticle
heal.classification	Τεχνολογία
heal.classification	Πληροφορική
heal.classification	Technology
heal.classification	Computer science
heal.classificationURI	N/A-Τεχνολογία
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85133147
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh85104738
heal.identifier.secondary	DOI: 10.1016/j.tcs.2013.12.017
heal.language	en
heal.access	campus
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2014-03-06
heal.bibliographicCitation	Eirinakis, P., Magos, D. and Mourtos, I. (2014) Blockers and antiblockers of stable matchings. Theoretical Computer Science. [Online] 524, pp.126-133. Available from: http://www.sciencedirect.com [Accessed 10/06/2015]	en
heal.abstract	An implicit linear description of the stable matching polytope is provided in terms of the blocker and antiblocker sets of constraints of the matroid-kernel polytope. The explicit identification of both these sets is based on a partition of the stable pairs in which each agent participates. Here, we expose the relation of such a partition to rotations. We provide a time-optimal algorithm for obtaining such a partition and establish some new related results; most importantly, that this partition is unique.	en
heal.publisher	Elsevier	en
heal.journalName	Theoretical Computer Science	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	true