{"id":"https://openalex.org/W7139093375","doi":"https://doi.org/10.1007/s00453-025-01347-3","title":"Max-Utility Matchings with Popularity via Critical Vertices","display_name":"Max-Utility Matchings with Popularity via Critical Vertices","publication_year":2026,"publication_date":"2026-03-19","ids":{"openalex":"https://openalex.org/W7139093375","doi":"https://doi.org/10.1007/s00453-025-01347-3"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01347-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01347-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s00453-025-01347-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130029451","display_name":"Telikepalli Kavitha","orcid":null},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5130029451"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66368626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"2","first_page":null,"last_page":null},"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.9878000020980835,"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.9878000020980835,"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/T12288","display_name":"Optimization and Search Problems","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0010999999940395355,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7609000205993652},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6747000217437744},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.586899995803833},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.40389999747276306},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.40059998631477356},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3880000114440918},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.37610000371932983},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3515999913215637},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.3409999907016754}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7609000205993652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6779000163078308},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6747000217437744},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.586899995803833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5701000094413757},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.40389999747276306},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.40059998631477356},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.37610000371932983},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3515999913215637},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3409999907016754},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.32989999651908875},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.3244999945163727},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30480000376701355},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28459998965263367},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.27390000224113464},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-025-01347-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01347-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01347-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01347-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320715","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1986105362","https://openalex.org/W2015634911","https://openalex.org/W2033301836","https://openalex.org/W2037078275","https://openalex.org/W2048888597","https://openalex.org/W2063222520","https://openalex.org/W2068115726","https://openalex.org/W2070982319","https://openalex.org/W2077485783","https://openalex.org/W2110013180","https://openalex.org/W2114200231","https://openalex.org/W2163984834","https://openalex.org/W2175150243","https://openalex.org/W2217441737","https://openalex.org/W2313049648","https://openalex.org/W2759253428","https://openalex.org/W2806692490","https://openalex.org/W2895466345","https://openalex.org/W2964264698","https://openalex.org/W2981653371","https://openalex.org/W2993996139","https://openalex.org/W3104045073","https://openalex.org/W3207901828","https://openalex.org/W3215636964","https://openalex.org/W3216207966","https://openalex.org/W4214836478","https://openalex.org/W4313256358","https://openalex.org/W4388461574","https://openalex.org/W4406651693","https://openalex.org/W4409868087","https://openalex.org/W4414427837"],"related_works":[],"abstract_inverted_index":{"Let":[0],"G":[1,80,93,219],"be":[2,83,144,226],"a":[3,10,20,110,115,135,141,160,191,196,221,237],"bipartite":[4],"graph":[5],"where":[6],"every":[7],"vertex":[8,21],"has":[9],"strict":[11],"preference":[12],"order":[13],"over":[14,22,29,273],"its":[15,23],"neighbors.":[16],"The":[17,147],"preferences":[18,28],"of":[19,162,250,260,276],"neighbors":[24],"extend":[25],"naturally":[26],"to":[27,46,53,108],"matchings.":[30,264,280],"A":[31,55],"matching":[32,38,56,64,71,117,125,142,150,198,206,224,245],"N":[33,45],"is":[34,58,62,72,98,107,122,152,203],"more":[35,65,126,207],"popular":[36,59,66,75,111,127,136,148,192,208,213,243,256,277],"than":[37,67,128,209],"M":[39,47,52,57,118,199],"if":[40,60],"the":[41,88,153,242,248,258,274],"vertices":[42,166,181],"that":[43,50,102,120,176,201,254],"prefer":[44,51],"outnumber":[48],"those":[49,174],"N.":[54],"there":[61,121,132,202],"no":[63,123,204],"M.":[68,129,210],"Every":[69],"stable":[70],"popular,":[73],"thus":[74],"matchings":[76,101,175,187,215,234,253],"always":[77,133,216],"exist":[78,217],"in":[79,92,156,167,172,218],"and":[81,96,189,220,235],"can":[82,143,225,267],"efficiently":[84,145,227,268],"computed.":[85,146,228],"We":[86,130,184,211,229],"consider":[87],"following":[89],"problem:":[90],"edges":[91],"have":[94],"utilities":[95],"it":[97],"only":[99,173],"max-utility":[100,112,116,124,137],"are":[103,170,255],"relevant.":[104],"Our":[105],"goal":[106],"find":[109],"matching,":[113,194],"i.e.,":[114,195,247],"such":[119,140,186,200,223],"show":[131,212,236],"exists":[134],"matching;":[138],"furthermore,":[139],"critical":[149,165,180,193,197,205,214,233,252,263,279],"algorithm":[151],"key":[154],"subroutine":[155],"our":[157],"algorithm.":[158],"Given":[159],"set":[161,259,275],"prioritized":[163],"or":[164],"G,":[168],"we":[169,266],"interested":[171],"match":[177],"as":[178,182],"many":[179],"possible.":[183],"call":[185],"\u201ccritical\u201d":[188],"seek":[190],"min-size/max-size":[222],"focus":[230],"on":[231],"max-size":[232,251,262,278],"compact":[238],"extended":[239],"formulation":[240],"for":[241],"max-critical":[244],"polytope,":[246],"polytope":[249],"within":[257],"all":[261],"Thus":[265],"solve":[269],"linear":[270],"optimization":[271],"problems":[272]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-03-20T00:00:00"}