{"id":"https://openalex.org/W4415188396","doi":"https://doi.org/10.1002/cpe.70331","title":"An Algorithm for Matching in a (3,3)\u2010Hypergraph With One\u2010Sided Preferences Having Quadratic Unpopularity Factor","display_name":"An Algorithm for Matching in a (3,3)\u2010Hypergraph With One\u2010Sided Preferences Having Quadratic Unpopularity Factor","publication_year":2025,"publication_date":"2025-10-14","ids":{"openalex":"https://openalex.org/W4415188396","doi":"https://doi.org/10.1002/cpe.70331"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.70331","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.70331","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","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/A5001933474","display_name":"Yashdeep Singh","orcid":null},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Yashdeep Singh","raw_affiliation_strings":["Department of Computer Science & Engineering Indian Institute of Technology Guwahati  Guwahati India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering Indian Institute of Technology Guwahati  Guwahati India","institution_ids":["https://openalex.org/I1317621060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105141248","display_name":"Sushanta Karmakar","orcid":"https://orcid.org/0000-0003-3528-304X"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sushanta Karmakar","raw_affiliation_strings":["Department of Computer Science & Engineering Indian Institute of Technology Guwahati  Guwahati India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering Indian Institute of Technology Guwahati  Guwahati India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001933474"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":{"value":4740,"currency":"USD","value_usd":4740},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36603594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"25-26","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.9926000237464905,"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.9926000237464905,"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/T11031","display_name":"Game Theory and Applications","score":0.9657999873161316,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9625999927520752,"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/matching","display_name":"Matching (statistics)","score":0.7878999710083008},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6338000297546387},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5814999938011169},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5522000193595886},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5504000186920166},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5110999941825867},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5065000057220459},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4537000060081482}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7878999710083008},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6338000297546387},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5814999938011169},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5522000193595886},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5504000186920166},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5110999941825867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5074999928474426},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5065000057220459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.478300005197525},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4537000060081482},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.428600013256073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3910999894142151},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3596000075340271},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3393999934196472},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30979999899864197},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.2937999963760376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29120001196861267},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.2872999906539917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.275299996137619},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2653000056743622}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.70331","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.70331","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1966569037","https://openalex.org/W1971903577","https://openalex.org/W1979125736","https://openalex.org/W2033301836","https://openalex.org/W2037078275","https://openalex.org/W2096797149","https://openalex.org/W2116007667","https://openalex.org/W2157529519","https://openalex.org/W2160429376","https://openalex.org/W2794945644","https://openalex.org/W2889480591","https://openalex.org/W2912036635","https://openalex.org/W2914186512","https://openalex.org/W2932499911","https://openalex.org/W4206967886","https://openalex.org/W4391529286","https://openalex.org/W4392348166","https://openalex.org/W4405936740"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"Given":[1],"two":[2,65],"distinct":[3],"sets":[4,149],"of":[5,10,32,68,98,107,127,150,180,210,222,236],"items":[6,33,81],"and":[7,61,146,155],"a":[8,46,96,108,114,166,182,194,197],"set":[9],"agents,":[11,57,223],"each":[12,21],"with":[13,201],"combined":[14],"preferences":[15,72],"for":[16],"selecting":[17],"one":[18],"item":[19],"from":[20],"set,":[22],"the":[23,41,53,59,74,80,105,125,137,148,153,178,207,220,234],"question":[24],"arises:":[25],"How":[26],"can":[27],"we":[28,39,118,187,214],"optimally":[29],"assign":[30],"pairs":[31],"to":[34,77],"agents?":[35],"To":[36,184],"address":[37,185],"this,":[38],"investigate":[40],"popular":[42,89,109,167],"matching":[43,86,94,110,154,168,195],"problem":[44],"in":[45,113,169,196,230],"3\u2010uniform":[47,115,198],"3\u2010partite":[48,116,199],"hypergraph.":[49],"In":[50],"this":[51],"setting,":[52],"first":[54,159],"partition":[55],"represents":[56],"while":[58],"second":[60],"third":[62],"partitions":[63],"represent":[64],"different":[66],"types":[67],"items.":[69],"Agents":[70],"express":[71],"over":[73,101,140],"hyperedges":[75],"incident":[76],"them,":[78],"whereas":[79],"have":[82],"no":[83,93],"preferences.":[84],"A":[85],"is":[87,111,134,206,219,233],"called":[88],"if":[90,172],"there":[91],"exists":[92],"that":[95,164,192,216],"majority":[97],"agents":[99,151],"prefer":[100],".":[102,130,225],"Since":[103],"determining":[104],"existence":[106],"NP\u2010hard":[112],"hypergraph,":[117],"focus":[119],"on":[120],"approximating":[121],"such":[122,181],"matchings":[123,143],"using":[124],"concept":[126],"unpopularity":[128,132,202],"factor":[129,133,203],"The":[131,226],"defined":[135],"as":[136],"maximum":[138,208],"ratio":[139],"all":[141],"other":[142],",":[144,156,204,217],"where":[145,205,218,232],"are":[147],"preferring":[152],"respectively.":[157],"We":[158],"present":[160],"an":[161,189],"exact":[162],"algorithm":[163,191,228],"computes":[165],"exponential":[170],"time":[171],"it":[173,176],"exists,":[174],"or":[175],"notifies":[177],"nonexistence":[179],"matching.":[183],"efficiency,":[186],"design":[188],"approximation":[190,227],"constructs":[193],"hypergraph":[200],"degree":[209],"any":[211],"agent.":[212],"Additionally,":[213],"show":[215],"number":[221,235],"implying":[224],"runs":[229],"time,":[231],"hyperedges.":[237]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-15T00:00:00"}