{"id":"https://openalex.org/W2963400632","doi":"https://doi.org/10.1609/aaai.v33i01.33011877","title":"Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity","display_name":"Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity","publication_year":2019,"publication_date":"2019-07-17","ids":{"openalex":"https://openalex.org/W2963400632","doi":"https://doi.org/10.1609/aaai.v33i01.33011877","mag":"2963400632"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v33i01.33011877","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33011877","pdf_url":"https://www.aaai.org/ojs/index.php/AAAI/article/download/4013/3891","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.aaai.org/ojs/index.php/AAAI/article/download/4013/3891","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071538560","display_name":"John P. Dickerson","orcid":"https://orcid.org/0000-0003-2231-680X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John P. Dickerson","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056358363","display_name":"Karthik Abinav Sankararaman","orcid":"https://orcid.org/0000-0002-8569-5694"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthik Abinav Sankararaman","raw_affiliation_strings":["University of Maryland College Park"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland College Park"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007399946","display_name":"Pan Xu","orcid":"https://orcid.org/0000-0002-6362-6727"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pan Xu","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"01","first_page":"1877","last_page":"1884"},"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.9793000221252441,"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.9793000221252441,"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.9575999975204468,"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":0.9244999885559082,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9154436588287354},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8487339019775391},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6224216818809509},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.5927135348320007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5883840918540955},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5713399052619934},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5009355545043945},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4208253026008606},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41976502537727356},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38588282465934753},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37290656566619873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3537817597389221},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33363446593284607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2898309826850891},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07284697890281677}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9154436588287354},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8487339019775391},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6224216818809509},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.5927135348320007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5883840918540955},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5713399052619934},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5009355545043945},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4208253026008606},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41976502537727356},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38588282465934753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37290656566619873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3537817597389221},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33363446593284607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2898309826850891},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07284697890281677},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v33i01.33011877","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33011877","pdf_url":"https://www.aaai.org/ojs/index.php/AAAI/article/download/4013/3891","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/4013","is_oa":true,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/4013","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4013/3891","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v33i01.33011877","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33011877","pdf_url":"https://www.aaai.org/ojs/index.php/AAAI/article/download/4013/3891","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1585283696","display_name":"EAGER: Probabilistic Models and Algorithms","funder_award_id":"1749864","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1749484715","display_name":"AF: Small: Randomized Algorithms and Stochastic Models","funder_award_id":"1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3344457238","display_name":null,"funder_award_id":"CCF-1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3541380492","display_name":null,"funder_award_id":"CNS 1010789 and CCF 1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5663050348","display_name":null,"funder_award_id":"CNS 1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6299987715","display_name":null,"funder_award_id":"CNS-1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G723030041","display_name":null,"funder_award_id":"CCF-1749864","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8911331200","display_name":"NetSE: Large: Collaborative Research: Contagion in Large Socio-Communication Networks","funder_award_id":"1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963400632.pdf","grobid_xml":"https://content.openalex.org/works/W2963400632.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W118259468","https://openalex.org/W205662698","https://openalex.org/W1514273496","https://openalex.org/W1680189815","https://openalex.org/W1742759255","https://openalex.org/W1816320414","https://openalex.org/W1912128066","https://openalex.org/W1981351071","https://openalex.org/W1993320088","https://openalex.org/W1997783781","https://openalex.org/W2007604989","https://openalex.org/W2010060477","https://openalex.org/W2021154117","https://openalex.org/W2029396991","https://openalex.org/W2029945631","https://openalex.org/W2072291569","https://openalex.org/W2113437680","https://openalex.org/W2125653933","https://openalex.org/W2132651631","https://openalex.org/W2153578526","https://openalex.org/W2153873625","https://openalex.org/W2162656786","https://openalex.org/W2166588237","https://openalex.org/W2170675255","https://openalex.org/W2183531780","https://openalex.org/W2251049298","https://openalex.org/W2342411541","https://openalex.org/W2398690976","https://openalex.org/W2413284370","https://openalex.org/W2430704425","https://openalex.org/W2463008130","https://openalex.org/W2473929617","https://openalex.org/W2542402847","https://openalex.org/W2556655121","https://openalex.org/W2592375611","https://openalex.org/W2614696229","https://openalex.org/W2626995008","https://openalex.org/W2740323002","https://openalex.org/W2752397656","https://openalex.org/W2753741836","https://openalex.org/W2770460298","https://openalex.org/W2949270856","https://openalex.org/W2951097138","https://openalex.org/W2952359104","https://openalex.org/W2952790532","https://openalex.org/W2963337212","https://openalex.org/W2964165521","https://openalex.org/W4294191157","https://openalex.org/W6604742208","https://openalex.org/W6634178873","https://openalex.org/W6648473300","https://openalex.org/W6655713097","https://openalex.org/W6683885168","https://openalex.org/W6685252657","https://openalex.org/W6686176709","https://openalex.org/W6712662495","https://openalex.org/W6734311152","https://openalex.org/W6917172014","https://openalex.org/W6960111140","https://openalex.org/W7075643991"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2785998768","https://openalex.org/W2945016732","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2804963084","https://openalex.org/W1966674384","https://openalex.org/W4289866291"],"abstract_inverted_index":{"In":[0,19,129],"bipartite":[1,10],"matching":[2,70],"problems,":[3,102],"vertices":[4,33],"on":[5,16,34,88,220],"one":[6,23],"side":[7,24,37],"of":[8,25,66,84,110,116,124,154,166],"a":[9,41,113,119,147,170],"graph":[11,27],"are":[12,207],"paired":[13],"with":[14],"those":[15],"the":[17,26,32,35,53,85,90,96,134,142,152,164,177],"other.":[18],"its":[20],"online":[21],"variant,":[22],"is":[28,104,144,159],"available":[29,60],"offline,":[30],"while":[31],"other":[36,184],"arrive":[38],"online.":[39],"When":[40],"vertex":[42,61],"arrives,":[43],"an":[44,59],"irrevocable":[45],"and":[46,80,126,174,206,222],"immediate":[47],"decision":[48],"should":[49],"be":[50],"made":[51],"by":[52],"algorithm;":[54],"either":[55],"match":[56],"it":[57,103],"to":[58,72,75,78,107,145,162,212,225],"or":[62],"drop":[63],"it.":[64],"Examples":[65],"such":[67],"problems":[68],"include":[69],"workers":[71],"firms,":[73],"advertisers":[74],"keywords,":[76],"organs":[77],"patients,":[79],"so":[81,127],"on.":[82,128],"Much":[83],"literature":[86],"focuses":[87],"maximizing":[89],"total":[91,94,193],"relevance\u2014modeled":[92],"via":[93],"weight\u2014of":[95],"matching.":[97],"However,":[98],"in":[99,189,195],"many":[100,183],"real-world":[101,221],"also":[105,217],"important":[106],"consider":[108],"contributions":[109],"diversity:":[111],"hiring":[112],"diverse":[114,122],"pool":[115],"candidates,":[117],"displaying":[118],"relevant":[120],"but":[121],"set":[123,153],"ads,":[125],"this":[130],"paper,":[131],"we":[132],"propose":[133,199],"Online":[135],"Submodular":[136],"Bipartite":[137],"Matching":[138],"(OSBM)":[139],"problem,":[140],"where":[141],"goal":[143],"maximize":[146],"submodular":[148],"function":[149],"f":[150],"over":[151],"matched":[155],"edges.":[156],"This":[157],"objective":[158,186],"general":[160],"enough":[161],"capture":[163],"notion":[165],"both":[167],"diversity":[168],"(e.g.,":[169,176,191],"weighted":[171],"coverage":[172],"function)":[173],"relevance":[175],"traditional":[178],"linear":[179],"function)\u2014as":[180],"well":[181],"as":[182],"natural":[185],"functions":[187],"occurring":[188],"practice":[190],"limited":[192],"budget":[194],"advertising":[196],"settings).":[197],"We":[198,216],"novel":[200],"algorithms":[201],"that":[202],"have":[203],"provable":[204],"guarantees":[205],"essentially":[208],"optimal":[209],"when":[210],"restricted":[211],"various":[213],"special":[214],"cases.":[215],"run":[218],"experiments":[219],"synthetic":[223],"datasets":[224],"validate":[226],"our":[227],"algorithms.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}