DC Field | Value | Language |
---|---|---|
dc.contributor.author | Arkin E.M. | ko |
dc.contributor.author | Bae S.W. | ko |
dc.contributor.author | Efrat A. | ko |
dc.contributor.author | Okamoto K. | ko |
dc.contributor.author | Mitchell J.S.B. | ko |
dc.contributor.author | Polishchuk V. | ko |
dc.date.accessioned | 2013-03-08T21:44:52Z | - |
dc.date.available | 2013-03-08T21:44:52Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.109, no.4, pp.219 - 224 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10203/94391 | - |
dc.description.abstract | We consider instances of the Stable Roommates problem that arise from geometric representation of participants' preferences: a participant is a point ill a metric space, and his preference list is given by the sorted list of distances to the other participants. We show that contrary to the general case, the problem admits a polynomial-time solution even in the case when ties are present in the preference lists. We define the notion of an alpha-stable matching: the participants are willing to switch partners only for a (multiplicative) improvement of at least alpha. We prove that, in general, finding alpha-stable matchings is not easier than finding matchings that are stable in the usual sense, We show that, unlike in the general case, in a three-dimensional geometric stable roommates problem, a 2-stable matching can be found in polynomial time. (C) 2008 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | MATCHING PROBLEMS | - |
dc.subject | CYCLIC PREFERENCES | - |
dc.subject | MARRIAGE | - |
dc.title | Geometric stable roommates | - |
dc.type | Article | - |
dc.identifier.wosid | 000262892600002 | - |
dc.identifier.scopusid | 2-s2.0-57749097529 | - |
dc.type.rims | ART | - |
dc.citation.volume | 109 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 219 | - |
dc.citation.endingpage | 224 | - |
dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
dc.identifier.doi | 10.1016/j.ipl.2008.10.003 | - |
dc.contributor.localauthor | Bae S.W. | - |
dc.contributor.nonIdAuthor | Arkin E.M. | - |
dc.contributor.nonIdAuthor | Efrat A. | - |
dc.contributor.nonIdAuthor | Okamoto K. | - |
dc.contributor.nonIdAuthor | Mitchell J.S.B. | - |
dc.contributor.nonIdAuthor | Polishchuk V. | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Algorithms | - |
dc.subject.keywordAuthor | Computational geometry | - |
dc.subject.keywordAuthor | Graph algorithms | - |
dc.subject.keywordAuthor | Stable roommates with ties | - |
dc.subject.keywordAuthor | Consistent preferences | - |
dc.subject.keywordAuthor | alpha-Stable matching | - |
dc.subject.keywordPlus | MATCHING PROBLEMS | - |
dc.subject.keywordPlus | CYCLIC PREFERENCES | - |
dc.subject.keywordPlus | MARRIAGE | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.