Matches in SemOpenAlex for { <https://semopenalex.org/work/W2115159265> ?p ?o ?g. }
Showing items 1 to 90 of
90
with 100 items per page.
- W2115159265 endingPage "92" @default.
- W2115159265 startingPage "53" @default.
- W2115159265 abstract "In a set of even cardinality n , each member ranks all the others in order of preference. A stable matching is a partition of the set into n /2 pairs, with the property that no two unpaired members both prefer each other to their partners under matching. It is known that for some problem instances no stable matching exists. In 1985, Irving found an O ( n 2 ) two-phase algorithm that would determine, for any instance, whether a stable matching exists, and if so, would find such a matching. Recently, Tan proved that Irving's algorithm, with a modified second phase, always finds a stable cyclic partition of the members set, which is a stable matching when each cycle has length two. In this paper we study a likely behavior of the algorithm under the assumption that an instance of the ranking system is chosen uniformly at random. We prove that the likely number of basic steps, i.e. the individual proposals in the first phase and the rotation eliminations, involving subsets of members in the second phase, is O ( n log n ), and that the likely size of a rotation is O (( n log n ) 1/2 ). We establish a ‘hyperbola law’ analogous to our past result on stable marriages. It states that at every step of the second phase, the product of the rank of proposers and the rank of proposal holders is asymptotic, in probability, to n 3 . We show that every stable cyclic partition is likely to be almost a stable matching, in the sense that at most O (( n log n ) 1/2 ) members can be involved in the cycles of length three or more." @default.
- W2115159265 created "2016-06-24" @default.
- W2115159265 creator A5084113050 @default.
- W2115159265 date "1993-03-01" @default.
- W2115159265 modified "2023-09-27" @default.
- W2115159265 title "On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm" @default.
- W2115159265 cites W1985690205 @default.
- W2115159265 cites W1990302986 @default.
- W2115159265 cites W1991220215 @default.
- W2115159265 cites W2017008045 @default.
- W2115159265 cites W2027449217 @default.
- W2115159265 cites W2029388009 @default.
- W2115159265 cites W2042587503 @default.
- W2115159265 cites W2060445186 @default.
- W2115159265 cites W2068115726 @default.
- W2115159265 cites W2068574579 @default.
- W2115159265 cites W2073621701 @default.
- W2115159265 cites W2090441553 @default.
- W2115159265 cites W2111559003 @default.
- W2115159265 cites W3037173771 @default.
- W2115159265 cites W4233413206 @default.
- W2115159265 cites W4240424045 @default.
- W2115159265 cites W4242255739 @default.
- W2115159265 cites W49714636 @default.
- W2115159265 doi "https://doi.org/10.1017/s0963548300000481" @default.
- W2115159265 hasPublicationYear "1993" @default.
- W2115159265 type Work @default.
- W2115159265 sameAs 2115159265 @default.
- W2115159265 citedByCount "12" @default.
- W2115159265 countsByYear W21151592652015 @default.
- W2115159265 countsByYear W21151592652016 @default.
- W2115159265 countsByYear W21151592652017 @default.
- W2115159265 countsByYear W21151592652018 @default.
- W2115159265 countsByYear W21151592652020 @default.
- W2115159265 countsByYear W21151592652021 @default.
- W2115159265 crossrefType "journal-article" @default.
- W2115159265 hasAuthorship W2115159265A5084113050 @default.
- W2115159265 hasConcept C10138342 @default.
- W2115159265 hasConcept C105795698 @default.
- W2115159265 hasConcept C11413529 @default.
- W2115159265 hasConcept C114614502 @default.
- W2115159265 hasConcept C118615104 @default.
- W2115159265 hasConcept C124101348 @default.
- W2115159265 hasConcept C146393371 @default.
- W2115159265 hasConcept C162324750 @default.
- W2115159265 hasConcept C164226766 @default.
- W2115159265 hasConcept C165064840 @default.
- W2115159265 hasConcept C182306322 @default.
- W2115159265 hasConcept C33923547 @default.
- W2115159265 hasConcept C41008148 @default.
- W2115159265 hasConcept C42812 @default.
- W2115159265 hasConcept C65236422 @default.
- W2115159265 hasConcept C87117476 @default.
- W2115159265 hasConceptScore W2115159265C10138342 @default.
- W2115159265 hasConceptScore W2115159265C105795698 @default.
- W2115159265 hasConceptScore W2115159265C11413529 @default.
- W2115159265 hasConceptScore W2115159265C114614502 @default.
- W2115159265 hasConceptScore W2115159265C118615104 @default.
- W2115159265 hasConceptScore W2115159265C124101348 @default.
- W2115159265 hasConceptScore W2115159265C146393371 @default.
- W2115159265 hasConceptScore W2115159265C162324750 @default.
- W2115159265 hasConceptScore W2115159265C164226766 @default.
- W2115159265 hasConceptScore W2115159265C165064840 @default.
- W2115159265 hasConceptScore W2115159265C182306322 @default.
- W2115159265 hasConceptScore W2115159265C33923547 @default.
- W2115159265 hasConceptScore W2115159265C41008148 @default.
- W2115159265 hasConceptScore W2115159265C42812 @default.
- W2115159265 hasConceptScore W2115159265C65236422 @default.
- W2115159265 hasConceptScore W2115159265C87117476 @default.
- W2115159265 hasIssue "1" @default.
- W2115159265 hasLocation W21151592651 @default.
- W2115159265 hasOpenAccess W2115159265 @default.
- W2115159265 hasPrimaryLocation W21151592651 @default.
- W2115159265 hasRelatedWork W1507630703 @default.
- W2115159265 hasRelatedWork W1990302986 @default.
- W2115159265 hasRelatedWork W2021623779 @default.
- W2115159265 hasRelatedWork W2068574579 @default.
- W2115159265 hasRelatedWork W2115159265 @default.
- W2115159265 hasRelatedWork W2727258341 @default.
- W2115159265 hasRelatedWork W2740105782 @default.
- W2115159265 hasRelatedWork W2963414285 @default.
- W2115159265 hasRelatedWork W3086542228 @default.
- W2115159265 hasRelatedWork W4299125676 @default.
- W2115159265 hasVolume "2" @default.
- W2115159265 isParatext "false" @default.
- W2115159265 isRetracted "false" @default.
- W2115159265 magId "2115159265" @default.
- W2115159265 workType "article" @default.