{"id":"https://openalex.org/W4308216314","doi":"https://doi.org/10.1109/allerton49937.2022.9929380","title":"Efficient Sequential UCB-based Hungarian Algorithm for Assignment Problems","display_name":"Efficient Sequential UCB-based Hungarian Algorithm for Assignment Problems","publication_year":2022,"publication_date":"2022-09-27","ids":{"openalex":"https://openalex.org/W4308216314","doi":"https://doi.org/10.1109/allerton49937.2022.9929380"},"language":"en","primary_location":{"id":"doi:10.1109/allerton49937.2022.9929380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton49937.2022.9929380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5044956245","display_name":"Yuyang Shi","orcid":"https://orcid.org/0000-0002-0178-7082"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuyang Shi","raw_affiliation_strings":["H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology"],"affiliations":[{"raw_affiliation_string":"H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005740286","display_name":"Yajun Mei","orcid":"https://orcid.org/0000-0002-1015-990X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yajun Mei","raw_affiliation_strings":["H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology"],"affiliations":[{"raw_affiliation_string":"H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044956245"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.339,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63860462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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/T11182","display_name":"Auction Theory and Applications","score":0.9951000213623047,"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/regret","display_name":"Regret","score":0.8081735372543335},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6524229049682617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6394163966178894},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5923506617546082},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5861872434616089},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5549138188362122},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.5508617162704468},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.5289514064788818},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4711134731769562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23766165971755981},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.21437421441078186},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07740071415901184}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8081735372543335},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6524229049682617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6394163966178894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5923506617546082},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5861872434616089},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5549138188362122},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5508617162704468},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.5289514064788818},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4711134731769562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23766165971755981},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.21437421441078186},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07740071415901184},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton49937.2022.9929380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton49937.2022.9929380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2626364667","display_name":null,"funder_award_id":"DMS-2015405","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6639737835","display_name":null,"funder_award_id":"UL1TR002378","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W35251828","https://openalex.org/W50486269","https://openalex.org/W1487320471","https://openalex.org/W1599154021","https://openalex.org/W1967174192","https://openalex.org/W2009551863","https://openalex.org/W2024106841","https://openalex.org/W2032382962","https://openalex.org/W2047281923","https://openalex.org/W2055150024","https://openalex.org/W2085717639","https://openalex.org/W2093562354","https://openalex.org/W2104357911","https://openalex.org/W2119738618","https://openalex.org/W2149342630","https://openalex.org/W2222512263","https://openalex.org/W2358698356","https://openalex.org/W2513180554","https://openalex.org/W2592998600","https://openalex.org/W2914156981","https://openalex.org/W2951505894","https://openalex.org/W4213223587","https://openalex.org/W4240989880","https://openalex.org/W4292022450","https://openalex.org/W6601392155","https://openalex.org/W6602031475","https://openalex.org/W6629353124","https://openalex.org/W6635904292","https://openalex.org/W6639210758","https://openalex.org/W6734301959"],"related_works":["https://openalex.org/W2028174200","https://openalex.org/W3086805279","https://openalex.org/W3212898247","https://openalex.org/W2382974548","https://openalex.org/W2384669999","https://openalex.org/W3146851126","https://openalex.org/W2991432931","https://openalex.org/W4247084708","https://openalex.org/W2075112623","https://openalex.org/W4281668797"],"abstract_inverted_index":{"The":[0],"assignment":[1,75,130],"problem":[2,123],"has":[3,20],"many":[4],"real-world":[5],"applications":[6],"such":[7],"as":[8],"allocations":[9],"of":[10,34,80,137,158],"agents":[11],"and":[12,36,48,109,145,149],"tasks":[13],"for":[14,87,140],"optimal":[15],"utility":[16,30,85],"gain.":[17],"While":[18],"it":[19],"been":[21],"well-studied":[22],"in":[23,67,119,128],"the":[24,28,44,56,63,78,83,102,106,113,120,125,129,134,142,146,156],"optimization":[25],"literature":[26],"when":[27,43],"underlying":[29],"between":[31],"every":[32],"pair":[33],"agent":[35],"task":[37],"is":[38,41,93],"known,":[39],"research":[40],"limited":[42],"utilities":[45,104],"are":[46,152],"unknown":[47,103],"need":[49],"to":[50,94,100,111,154],"be":[51],"learned":[52],"from":[53],"data":[54],"on":[55],"fly.":[57],"In":[58],"this":[59],"work,":[60],"motivated":[61],"by":[62],"mentor-mentee":[64],"matching":[65],"application":[66],"U.S.":[68],"universities,":[69],"we":[70],"develop":[71],"an":[72],"efficient":[73],"sequential":[74],"algorithm,":[76],"with":[77,124],"objective":[79],"nearly":[81],"maximizing":[82],"overall":[84],"simultaneously":[86],"each":[88],"time.":[89],"Our":[90],"proposed":[91],"algorithm":[92,127,139],"use":[95],"stochastic":[96],"binary":[97],"bandit":[98,122],"feedback":[99],"estimate":[101],"through":[105],"logistic":[107],"regression,":[108],"then":[110],"combine":[112],"Upper":[114],"Confidence":[115],"Bound":[116],"(UCB)":[117],"method":[118],"multi-armed":[121],"Hungarian":[126],"problem.":[131],"We":[132],"derive":[133],"theoretical":[135],"bounds":[136],"our":[138,159],"both":[141],"estimation":[143],"error":[144],"total":[147],"regret,":[148],"numerical":[150],"studies":[151],"conducted":[153],"illustrate":[155],"usefulness":[157],"algorithm.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}