{"id":"https://openalex.org/W2548768546","doi":"https://doi.org/10.1137/140996690","title":"On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One","display_name":"On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2548768546","doi":"https://doi.org/10.1137/140996690","mag":"2548768546"},"language":"en","primary_location":{"id":"doi:10.1137/140996690","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140996690","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101427454","display_name":"Christine T. Cheng","orcid":"https://orcid.org/0000-0003-0524-5368"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Christine T. Cheng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101427454"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.2892,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.96654689,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"30","issue":"4","first_page":"2047","last_page":"2063"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8423862457275391},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7420244812965393},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.7279557585716248},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5559492111206055},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5340724587440491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4949578642845154},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49121445417404175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48895299434661865},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45767518877983093},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4520754814147949},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4133143424987793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36644360423088074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09705573320388794}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8423862457275391},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7420244812965393},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.7279557585716248},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5559492111206055},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5340724587440491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4949578642845154},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49121445417404175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48895299434661865},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45767518877983093},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4520754814147949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4133143424987793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36644360423088074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09705573320388794},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/140996690","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140996690","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.697.8532","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.697.8532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwm.edu/faculty/ccheng/papers/ROM-JournalVersion.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W200056458","https://openalex.org/W1509056525","https://openalex.org/W1542154458","https://openalex.org/W1594069552","https://openalex.org/W2009653834","https://openalex.org/W2024552920","https://openalex.org/W2041746084","https://openalex.org/W2045754948","https://openalex.org/W2057990406","https://openalex.org/W2068115726","https://openalex.org/W2079742612","https://openalex.org/W2083004396","https://openalex.org/W2083091948","https://openalex.org/W2091887239","https://openalex.org/W2105688526","https://openalex.org/W2143529993","https://openalex.org/W2162195070","https://openalex.org/W3123159236","https://openalex.org/W4235234911"],"related_works":["https://openalex.org/W4299682028","https://openalex.org/W2951846908","https://openalex.org/W3200900840","https://openalex.org/W4322508012","https://openalex.org/W2141183298","https://openalex.org/W2186470546","https://openalex.org/W2145824340","https://openalex.org/W3123407378","https://openalex.org/W2593419644","https://openalex.org/W3125506481"],"abstract_inverted_index":{"The":[0],"random":[1],"order":[2],"mechanism":[3],"(ROM)":[4],"can":[5,43,84,124,160],"be":[6,44,161],"thought":[7],"of":[8,13,148,186,202,212,215],"as":[9],"a":[10,26,60,76,103,126,166],"sequential":[11],"version":[12],"Gale":[14],"and":[15,28,69,196],"Shapley's":[16],"deferred-acceptance":[17],"(DA)":[18],"algorithm,":[19,41,52],"where":[20],"agents":[21],"are":[22,173,206],"arriving":[23],"one":[24],"at":[25,137],"time,":[27],"each":[29],"newly":[30],"arrived":[31],"agent":[32,135],"has":[33,136],"an":[34,117],"opportunity":[35],"to":[36,58,95,176,189],"propose.":[37],"Like":[38],"the":[39,50,67,131,152,179,184,199,210,216],"DA":[40,51],"ROM":[42,57,83,123,164],"implemented":[45],"in":[46,130,165],"polynomial":[47],"time.":[48],"Unlike":[49],"it":[53],"is":[54,64,80,107,109,116],"possible":[55],"for":[56,120],"output":[59,85],"stable":[61,71,77,105,128,140,157,187,194],"matching":[62,78,106,129],"that":[63,75,100,114,159,171,198],"different":[65],"from":[66],"man-optimal":[68],"woman-optimal":[70],"matchings.":[72],"We":[73,142,169],"say":[74],"$\\mu$":[79],"ROM-reachable":[81,108,207],"if":[82,102,122,204],"$\\mu$.":[86],"In":[87,151,178],"this":[88,149],"paper,":[89],"we":[90,98,112,155,182,191],"investigate":[91],"computational":[92,200],"questions":[93],"related":[94],"ROM-reachability.":[96],"First,":[97],"prove":[99,197],"determining":[101,121,203],"particular":[104],"NP-complete.":[110],"However,":[111],"show":[113,170],"there":[115],"efficient":[118],"algorithm":[119],"reach":[125],"nontrivial":[127],"case":[132],"when":[133],"every":[134],"least":[138],"two":[139,145],"partners.":[141],"then":[143],"study":[144],"restricted":[146],"versions":[147],"problem.":[150],"first":[153],"version,":[154,181],"consider":[156],"matchings":[158,188,195],"reached":[162],"by":[163],"\u201cdirect\u201d":[167],"manner.":[168],"they":[172,205],"computationally":[174],"easy":[175],"recognize.":[177],"second":[180],"restrict":[183],"class":[185],"what":[190],"call":[192],"extreme":[193],"complexity":[201],"depends":[208],"on":[209],"number":[211],"unstable":[213],"partners":[214],"agents.":[217]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}