{"id":"https://openalex.org/W2063222520","doi":"https://doi.org/10.1137/120902562","title":"A Size-Popularity Tradeoff in the Stable Marriage Problem","display_name":"A Size-Popularity Tradeoff in the Stable Marriage Problem","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2063222520","doi":"https://doi.org/10.1137/120902562","mag":"2063222520"},"language":"en","primary_location":{"id":"doi:10.1137/120902562","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120902562","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062523877"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9726,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.97041368,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"43","issue":"1","first_page":"52","last_page":"71"},"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.9994999766349792,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9297000169754028,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9246000051498413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8487297892570496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8463575839996338},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7838225364685059},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7145813703536987},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6740502715110779},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5903161764144897},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.4457027018070221},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4348657727241516},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4134998321533203},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32818180322647095},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08474773168563843}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8487297892570496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8463575839996338},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7838225364685059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7145813703536987},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6740502715110779},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5903161764144897},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.4457027018070221},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4348657727241516},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4134998321533203},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32818180322647095},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08474773168563843},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120902562","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120902562","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Gender equality","id":"https://metadata.un.org/sdg/5"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2033301836","https://openalex.org/W2048888597","https://openalex.org/W2063897561","https://openalex.org/W2175150243","https://openalex.org/W2914186512","https://openalex.org/W4235234911","https://openalex.org/W4235976152","https://openalex.org/W4253633138"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2151412766","https://openalex.org/W4377864796","https://openalex.org/W1966674384","https://openalex.org/W4387463364","https://openalex.org/W2999623507","https://openalex.org/W1956023299","https://openalex.org/W2362975861","https://openalex.org/W2561454982","https://openalex.org/W2962683253"],"abstract_inverted_index":{"Given":[0],"a":[1,15,24,43,63,67,106,139,178,234,271,290,300],"bipartite":[2],"graph":[3],"$G":[4],"=":[5,159,192,196],"(\\mathcal{A}\\cup\\mathcal{B},":[6],"E)$":[7],"where":[8,40,54,85,190,263],"each":[9],"vertex":[10],"ranks":[11],"its":[12,221],"neighbors":[13],"in":[14,47,92,111,154,187,213,219,274,296],"strict":[16],"order":[17],"of":[18,22,150,209,217,241,257,276,303],"preference,":[19],"the":[20,99,134,148,199,207,214,231],"problem":[21],"computing":[23,105],"stable":[25,33,64],"matching":[26,34,46,65,73,84,110,117,142,167,179,201,238,272,291,308],"is":[27,42,57,60,66,75,82,118,129,137,145,163,169,203,253,270,284],"classical":[28],"and":[29,49,126,161,183,194],"well":[30],"studied.":[31],"A":[32,72,113],"has":[35],"size":[36,45,69,108,115,122,141,152,166,211,236,242,277,306],"at":[37,123,278,285],"least":[38,124,279],"$\\frac{1}{2}|M_{\\max}|$,":[39],"$M_{\\max}$":[41],"maximum":[44,107,114,140,151,165,210,235,305],"$G$,":[48,155,220],"there":[50,81,138,162,252,269],"are":[51,88],"simple":[52,301],"examples":[53],"this":[55,95,127],"bound":[56,128],"tight.":[58,130],"It":[59],"known":[61],"that":[62,144,156,168,176],"minimum":[68],"popular":[70,79,109,116,146,171,204,237,307],"matching.":[71],"$M$":[74],"said":[76],"to":[77,120,206],"be":[78,185,225,240,294],"if":[80],"no":[83,164],"more":[86,170],"vertices":[87],"better":[89],"off":[90],"than":[91,172],"$M$.":[93],"In":[94,245],"paper":[96],"we":[97,250],"show":[98,175,251],"first":[100],"linear":[101],"time":[102,298],"algorithm":[103],"for":[104,259],"$G$.":[112],"guaranteed":[119],"have":[121],"$\\frac{2}{3}|M_{\\max}|$,":[125],"We":[131,174],"then":[132],"consider":[133],"following":[135],"problem:":[136],"$M^*$":[143,180,202],"within":[147],"set":[149,208,216],"matchings":[153,218],"is,":[157],"$|M^*|":[158],"|M_{\\max}|$":[160],"$M^*$?":[173],"such":[177,289],"always":[181],"exists":[182],"can":[184,293],"computed":[186,295],"$O(mn_0)$":[188],"time,":[189],"$m":[191],"|E|$":[193],"$n_0":[195],"\\min(|\\mathcal{A}|,|\\mathcal{B}|)$.":[197],"Though":[198],"above":[200],"restricted":[205],"matchings,":[212],"entire":[215,255],"unpopularity":[222,282],"factor":[223,283],"could":[224,239],"as":[226,228],"high":[227],"$n_0-1$.":[229],"On":[230],"other":[232],"hand,":[233],"only":[243],"$\\frac{2}{3}|M_{\\max}|$.":[244],"between":[246],"these":[247],"two":[248],"extremes,":[249],"an":[254],"spectrum":[256],"matchings:":[258],"any":[260],"integer":[261],"$k$,":[262],"$2":[264],"\\le":[265,267],"k":[266],"n_0$,":[268],"$M_k$":[273,292],"$G$":[275],"$\\frac{k}{k+1}|M_{\\max}|$":[280],"whose":[281],"most":[286],"$k-1$.":[287],"Also,":[288],"$O(km)$":[297],"by":[299],"generalization":[302],"our":[304],"algorithm.":[309]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}