{"id":"https://openalex.org/W7123368262","doi":"https://doi.org/10.1109/cdc57313.2025.11312887","title":"Offline and Online Distributed Submodular Maximization under a Partitioned Matroid Constraint","display_name":"Offline and Online Distributed Submodular Maximization under a Partitioned Matroid Constraint","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123368262","doi":"https://doi.org/10.1109/cdc57313.2025.11312887"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5102978887","display_name":"Lintao Ye","orcid":"https://orcid.org/0000-0003-0337-1651"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lintao Ye","raw_affiliation_strings":["Huazhong University of Science and Technology,School of Artificial Intelligence and Automation,Wuhan,China,430074"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology,School of Artificial Intelligence and Automation,Wuhan,China,430074","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083504272","display_name":"Bin Du","orcid":"https://orcid.org/0000-0002-0004-5378"},"institutions":[{"id":"https://openalex.org/I9842412","display_name":"Nanjing University of Aeronautics and Astronautics","ror":"https://ror.org/01scyh794","country_code":"CN","type":"education","lineage":["https://openalex.org/I9842412"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Du","raw_affiliation_strings":["Nanjing University of Aeronautics and Astronautics,College of Automation Engineering,Nanjing,China,211106"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Aeronautics and Astronautics,College of Automation Engineering,Nanjing,China,211106","institution_ids":["https://openalex.org/I9842412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122883500","display_name":"Zhi-Wei Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi-Wei Liu","raw_affiliation_strings":["Huazhong University of Science and Technology,School of Artificial Intelligence and Automation,Wuhan,China,430074"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology,School of Artificial Intelligence and Automation,Wuhan,China,430074","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102978887"],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71557272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6877","last_page":"6884"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.4415000081062317,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.4415000081062317,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.19300000369548798,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.06019999831914902,"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.8535000085830688},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7519999742507935},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5454999804496765},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49230000376701355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46799999475479126},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41940000653266907},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.398499995470047},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3294000029563904}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8535000085830688},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7519999742507935},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5110999941825867},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49230000376701355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46799999475479126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42500001192092896},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41940000653266907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3993000090122223},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29030001163482666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2759999930858612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2752000093460083},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2581000030040741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,64,114,135],"study":[1],"a":[2,10,21,29,44,66,83,88,96,131],"distributed":[3,67,139],"framework":[4],"for":[5,141],"solving":[6],"sub-modular":[7],"maximization":[8],"under":[9],"partitioned":[11],"matroid":[12],"constraint.":[13],"A":[14],"group":[15],"of":[16,38,56,91,99,110,120],"agents":[17,40,76],"are":[18],"connected":[19],"by":[20,60],"graph":[22,80],"and":[23,81],"each":[24],"agent":[25],"needs":[26],"to":[27,42,53,69],"choose":[28],"subset":[30],"from":[31],"its":[32],"local":[33],"ground":[34],"set.":[35],"The":[36],"goal":[37],"the":[39,54,57,62,71,75,79,92,103,108,111,121,124],"is":[41,49,87,107],"maximize":[43],"global":[45,84,125],"objective":[46,126],"function":[47,127],"that":[48,73,86,148],"submodular":[50,112],"with":[51,144],"respect":[52],"union":[55],"sets":[58],"chosen":[59],"all":[61],"agents.":[63],"propose":[65,136],"algorithm":[68,140],"solve":[70],"problem":[72,122],"lets":[74],"communicate":[77],"over":[78,130],"return":[82],"solution":[85,94],"1/(1+c)":[89],"approximation":[90],"optimal":[93],"in":[95],"finite":[97],"number":[98],"communication":[100],"rounds":[101],"among":[102],"agents,":[104],"where":[105,123],"c":[106],"curvature":[109],"function.":[113],"further":[115],"consider":[116],"an":[117,137],"online":[118,138],"setting":[119,143],"can":[128],"change":[129],"time":[132],"horizon":[133],"T.":[134],"this":[142],"$\\frac{1}{{1":[145],"+":[146],"c}}$-regret":[147],"scales":[149],"as":[150],"$\\sqrt":[151],"T$.":[152]},"counts_by_year":[],"updated_date":"2026-01-14T00:46:21.520733","created_date":"2026-01-14T00:00:00"}