{"id":"https://openalex.org/W4283215429","doi":"https://doi.org/10.1109/infocom48880.2022.9796963","title":"A Unified Model for Bi-objective Online Stochastic Bipartite Matching with Two-sided Limited Patience","display_name":"A Unified Model for Bi-objective Online Stochastic Bipartite Matching with Two-sided Limited Patience","publication_year":2022,"publication_date":"2022-05-02","ids":{"openalex":"https://openalex.org/W4283215429","doi":"https://doi.org/10.1109/infocom48880.2022.9796963"},"language":"en","primary_location":{"id":"doi:10.1109/infocom48880.2022.9796963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom48880.2022.9796963","pdf_url":null,"source":{"id":"https://openalex.org/S4363607980","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","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/A5110090902","display_name":"Gao-fei Xiao","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Gaofei Xiao","raw_affiliation_strings":["Nanjing University,State Key Laboratory for Novel Software Technology,China","State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University,State Key Laboratory for Novel Software Technology,China","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101513130","display_name":"Jiaqi Zheng","orcid":"https://orcid.org/0000-0001-8403-9655"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiaqi Zheng","raw_affiliation_strings":["Nanjing University,State Key Laboratory for Novel Software Technology,China","State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University,State Key Laboratory for Novel Software Technology,China","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003181030","display_name":"Haipeng Dai","orcid":"https://orcid.org/0000-0003-0545-8187"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haipeng Dai","raw_affiliation_strings":["Nanjing University,State Key Laboratory for Novel Software Technology,China","State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University,State Key Laboratory for Novel Software Technology,China","institution_ids":["https://openalex.org/I881766915"]},{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110090902"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0483871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2019","issue":null,"first_page":"1079","last_page":"1088"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7734784483909607},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7425664663314819},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6917375326156616},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6680001616477966},{"id":"https://openalex.org/keywords/patience","display_name":"Patience","score":0.6418793201446533},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6191710829734802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5288682579994202},{"id":"https://openalex.org/keywords/crowdsourcing","display_name":"Crowdsourcing","score":0.45910003781318665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36556684970855713},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35563570261001587},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3388370871543884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3334750533103943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33341357111930847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3282051086425781},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.14392593502998352},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.1251697540283203},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11325541138648987},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09954264760017395}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7734784483909607},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7425664663314819},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6917375326156616},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6680001616477966},{"id":"https://openalex.org/C2779755727","wikidata":"https://www.wikidata.org/wiki/Q15304496","display_name":"Patience","level":2,"score":0.6418793201446533},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6191710829734802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5288682579994202},{"id":"https://openalex.org/C62230096","wikidata":"https://www.wikidata.org/wiki/Q275969","display_name":"Crowdsourcing","level":2,"score":0.45910003781318665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36556684970855713},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35563570261001587},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3388370871543884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3334750533103943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33341357111930847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3282051086425781},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14392593502998352},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.1251697540283203},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11325541138648987},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09954264760017395},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom48880.2022.9796963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom48880.2022.9796963","pdf_url":null,"source":{"id":"https://openalex.org/S4363607980","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W205662698","https://openalex.org/W243342323","https://openalex.org/W1577719727","https://openalex.org/W1890643295","https://openalex.org/W1909971775","https://openalex.org/W2007604989","https://openalex.org/W2029945631","https://openalex.org/W2153873625","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2183531780","https://openalex.org/W2285500630","https://openalex.org/W2342411541","https://openalex.org/W2394800294","https://openalex.org/W2398690976","https://openalex.org/W2482402787","https://openalex.org/W2525830997","https://openalex.org/W2556655121","https://openalex.org/W2571343094","https://openalex.org/W2592375611","https://openalex.org/W2770460298","https://openalex.org/W2789143183","https://openalex.org/W2799785707","https://openalex.org/W2903602506","https://openalex.org/W2949691426","https://openalex.org/W2950344037","https://openalex.org/W2963025088","https://openalex.org/W2963337212","https://openalex.org/W2963400632","https://openalex.org/W2971251669","https://openalex.org/W2977787594","https://openalex.org/W2994933044","https://openalex.org/W3005368569","https://openalex.org/W3006942659","https://openalex.org/W3034504825","https://openalex.org/W3101519497","https://openalex.org/W3107115733","https://openalex.org/W4321595806","https://openalex.org/W6639249596","https://openalex.org/W6686176709","https://openalex.org/W6712662495","https://openalex.org/W6718966728","https://openalex.org/W6730500363","https://openalex.org/W6767507274","https://openalex.org/W6772065203","https://openalex.org/W6785931186","https://openalex.org/W6849876941"],"related_works":["https://openalex.org/W2809638413","https://openalex.org/W4320837119","https://openalex.org/W3000166930","https://openalex.org/W4287905780","https://openalex.org/W2902906275","https://openalex.org/W4289236540","https://openalex.org/W4312434266","https://openalex.org/W4226297878","https://openalex.org/W4296405177","https://openalex.org/W4283215429"],"abstract_inverted_index":{"Bi-objective":[0],"online":[1,15,49,81,91,121],"stochastic":[2,92],"bipartite":[3,93],"matching":[4,94],"can":[5,61,96,187],"capture":[6],"a":[7,41,86,98,194],"wide":[8],"range":[9],"of":[10,133],"real-world":[11],"problems":[12],"such":[13,170],"as":[14,64],"ride-hailing,":[16],"crowdsourcing":[17],"markets,":[18],"and":[19,33,53,60,69,106,115,126,144,192],"internet":[20],"adverting,":[21],"where":[22,136],"the":[23,26,36,65,102,129],"vertices":[24,107],"in":[25,31,35,47],"left":[27],"side":[28,38],"are":[29,56,139],"known":[30,42],"advance":[32],"that":[34,95,154,171,184],"right":[37],"arrive":[39],"from":[40],"identical":[43],"independent":[44],"distribution":[45],"(KIID)":[46],"an":[48],"manner.":[50],"Mutual":[51],"interest":[52],"limited":[54,71],"attention-span":[55],"two":[57,111,140],"common":[58],"conditions":[59],"be":[62],"modeled":[63],"edge":[66],"existence":[67],"probability":[68],"two-sided":[70],"patience.":[72],"Existing":[73],"works":[74],"fail":[75],"to":[76,123],"take":[77],"them":[78],"into":[79],"bi-objective":[80,90],"optimization.":[82],"This":[83],"paper":[84],"establishes":[85],"unified":[87],"model":[88],"for":[89],"provide":[97,193],"general":[99],"tradeoff":[100,124],"among":[101],"matched":[103],"edges":[104],"(OBJ-1)":[105],"(OBJ-2).":[108],"We":[109],"formulate":[110],"linear":[112],"programs":[113],"(LP)":[114],"accordingly":[116],"design":[117],"four":[118],"LP-based":[119],"parameterized":[120],"algorithms":[122,186],"OBJ-1":[125],"OBJ-2,":[127],"with":[128],"best":[130],"competitive":[131],"ratio":[132],"(0.3528\u03b1,":[134],"0.3528\u03b2),":[135],"\u03b1,":[137],"\u03b2":[138,147],"positive":[141],"input":[142],"parameters":[143],"\u03b1":[145],"+":[146,174],"=":[148],"1.":[149],"Our":[150],"hardness":[151],"analysis":[152],"proves":[153],"any":[155],"non-adaptive":[156],"algorithm":[157],"cannot":[158],"achieve":[159,189],"(\u03b4":[160],"<inf":[161,166],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[162,167],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</inf>":[163],",":[164],"\u03b4":[165],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[168],")-competitive":[169],"${\\delta":[172],"_1}":[173],"{\\delta":[175],"_2}":[176],">":[177],"1":[178],"-":[179],"\\frac{1}{e}$.":[180],"Trace-driven":[181],"experiments":[182],"show":[183],"our":[185],"always":[188],"better":[190],"performance":[191],"flexible":[195],"tradeoff.":[196]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}