{"id":"https://openalex.org/W3001275923","doi":"https://doi.org/10.5555/3381089.3381109","title":"Quasi-popular matchings, optimality, and extended formulations","display_name":"Quasi-popular matchings, optimality, and extended formulations","alternate_titles":[],"publication_year":2020,"publication_date":"2020-01-05","ids":{"openalex":"https://openalex.org/W3001275923","doi":"https://doi.org/10.5555/3381089.3381109","mag":"3001275923"},"language":"en","primary_location":{"id":"mag:3001275923","doi":"https://doi.org/10.5555/3381089.3381109","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-05974","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W3001275923"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5073986859","display_name":"Yuri Faenza","orcid":"https://orcid.org/0000-0002-3148-2159","observed_orcids":["https://orcid.org/0000-0002-3148-2159"]},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuri Faenza","raw_affiliation_strings":["Columbia University"],"raw_orcid":"https://orcid.org/0000-0002-3148-2159","affiliations":[{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606","observed_orcids":["https://orcid.org/0000-0003-2619-6606"]},"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":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Tata Institute of Fundamental Research Mumbai India"],"raw_orcid":"https://orcid.org/0000-0003-2619-6606","affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research Mumbai India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9286,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.96660752,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"325","last_page":"344"},"is_retracted":false,"is_pulled":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.0003000000142492354,"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/T12288","display_name":"Optimization and Search Problems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/popular-matchings","display_name":"popular matchings","score":0.996999979019165},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"stable marriage problem","score":0.9750000238418579},{"id":"https://openalex.org/keywords/bicriteria-approximation","display_name":"bicriteria approximation","score":0.8880000114440918},{"id":"https://openalex.org/keywords/extension-complexity","display_name":"extension complexity","score":0.6549999713897705},{"id":"https://openalex.org/keywords/matching-polytope","display_name":"matching polytope","score":0.8140000104904175},{"id":"https://openalex.org/keywords/extended-formulations","display_name":"extended formulations","score":0.6710000038146973},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7839999794960022},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.5960000157356262},{"id":"https://openalex.org/keywords/edge-costs","display_name":"edge costs","score":0.40299999713897705}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7113823890686035},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.690853476524353},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5905601382255554},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5622013807296753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5592343211174011},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4432266652584076},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4269292950630188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39300912618637085},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07530272006988525},{"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":"mag:3001275923","doi":"https://doi.org/10.5555/3381089.3381109","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-05974","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4409868087","https://openalex.org/W6929418983","https://openalex.org/W3104045073","https://openalex.org/W3115849663","https://openalex.org/W1630623148","https://openalex.org/W4404344926","https://openalex.org/W2547342773","https://openalex.org/W2970135710","https://openalex.org/W7099453683","https://openalex.org/W2901363005"],"abstract_inverted_index":{"Let":[0,113],"G":[1,31],"=":[2],"(A":[3],"\u222a":[4],"B,":[5],"E)":[6],"be":[7,115],"an":[8,191],"instance":[9],"of":[10,25,51,58,62,70,94,118,131,140,162,174,217],"the":[11,56,60,100,116,138,169,196,223],"stable":[12,52,73],"marriage":[13],"problem":[14,104],"where":[15],"every":[16],"vertex":[17],"ranks":[18],"its":[19],"neighbors":[20],"in":[21,30,154],"a":[22,39,48,67,76,91,119,129,149,157,172,186,214],"strict":[23],"order":[24],"preference.":[26],"A":[27],"matching":[28,74,93,103,130,161,200,216,227],"M":[29,35],"is":[32,75,87,105,125,148,210],"popular":[33,78,92,102,121,197,224],"if":[34],"does":[36],"not":[37],"lose":[38],"head-to-head":[40],"election":[41],"against":[42],"any":[43,111],"matching.":[44,79,122],"Popular":[45],"matchings":[46],"are":[47,83,171],"well-studied":[49],"generalization":[50],"matchings,":[53],"introduced":[54],"with":[55],"goal":[57,124],"enlarging":[59],"set":[61],"admissible":[63],"solutions,":[64],"while":[65],"maintaining":[66],"certain":[68,177],"level":[69],"fairness.":[71],"Every":[72],"min-size":[77],"Unfortunately,":[80],"when":[81],"there":[82],"edge":[84],"costs,":[85],"it":[86,209],"NP-hard":[88,211],"to":[89,107,110,126,168,180,212],"find":[90,213],"minimum":[95,218],"cost":[96,117,132,163],"-":[97],"even":[98],"worse,":[99],"min-cost":[101,120],"hard":[106],"approximate":[108],"up":[109],"factor.":[112],"opt":[114,135],"Our":[123,144],"efficiently":[127],"compute":[128],"at":[133,164],"most":[134,165],"by":[136,206],"paying":[137],"price":[139],"mildly":[141],"relaxing":[142],"popularity.":[143],"main":[145],"positive":[146],"result":[147],"bi-criteria":[150],"algorithm":[151,170],"that":[152,208,221],"finds":[153],"polynomial":[155],"time":[156],"near-popular":[158],"or":[159],"quasi-popular":[199,215,226],"opt.":[166],"Key":[167],"number":[173],"results":[175,205],"for":[176,190],"polytopes":[178,228],"related":[179],"matchings.":[181],"In":[182],"particular,":[183],"we":[184],"give":[185],"polynomial-size":[187],"extended":[188],"formulation":[189],"integral":[192],"polytope":[193],"sandwiched":[194],"between":[195],"and":[198,220,225],"polytopes.":[201],"We":[202],"complement":[203],"these":[204],"showing":[207],"cost,":[219],"both":[222],"have":[229],"near-exponential":[230],"extension":[231],"complexity.":[232]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3001275923","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2020-01-30T00:00:00"}
