{"id":"https://openalex.org/W4411320054","doi":"https://doi.org/10.1145/3717823.3718131","title":"The Cost of Consistency: Submodular Maximization with Constant Recourse","display_name":"The Cost of Consistency: Submodular Maximization with Constant Recourse","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411320054","doi":"https://doi.org/10.1145/3717823.3718131"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718131","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/251418","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001194202","display_name":"Paul D\u00fctting","orcid":"https://orcid.org/0000-0002-0635-6812"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Paul D\u00fctting","raw_affiliation_strings":["Google Research, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056878852","display_name":"Federico Fusco","orcid":"https://orcid.org/0000-0001-6250-945X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Fusco","raw_affiliation_strings":["Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022550622","display_name":"Silvio Lattanzi","orcid":"https://orcid.org/0000-0002-3502-7559"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silvio Lattanzi","raw_affiliation_strings":["Google Research, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Google Research, Barcelona, Spain","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005843027","display_name":"Ashkan Norouzi-Fard","orcid":"https://orcid.org/0000-0002-2336-9826"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ashkan Norouzi-Fard","raw_affiliation_strings":["Google Research, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024817143","display_name":"Morteza Zadimoghaddam","orcid":"https://orcid.org/0000-0003-0717-1120"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Morteza Zadimoghaddam","raw_affiliation_strings":["Google Research, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5001194202"],"corresponding_institution_ids":["https://openalex.org/I4210100430"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15091151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1406","last_page":"1417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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.998199999332428,"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/T10237","display_name":"Cryptography and Data Security","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8878532648086548},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7466590404510498},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.6503121852874756},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.589289665222168},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5123673677444458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4423464238643646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.439081609249115},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.37836602330207825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1690933108329773},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.04977419972419739}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8878532648086548},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7466590404510498},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6503121852874756},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.589289665222168},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5123673677444458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4423464238643646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.439081609249115},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.37836602330207825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1690933108329773},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.04977419972419739}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3717823.3718131","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/251418","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/251418","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},{"id":"pmh:oai:iris.uniroma1.it:11573/1744848","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1744848","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/251418","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/251418","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W2021736779","https://openalex.org/W2038938388","https://openalex.org/W2053381548","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2890692662","https://openalex.org/W2950023069","https://openalex.org/W3013599369","https://openalex.org/W3160905013","https://openalex.org/W3214642224","https://openalex.org/W4226265617","https://openalex.org/W4287598791","https://openalex.org/W4287677506","https://openalex.org/W4379357816","https://openalex.org/W4385327619","https://openalex.org/W4404848982","https://openalex.org/W4406302067"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254"],"abstract_inverted_index":{"In":[0,20],"this":[1],"work,":[2,106],"we":[3,22,83],"study":[4],"online":[5],"submodular":[6,60],"maximization":[7],"and":[8,62,115,121],"how":[9],"the":[10,18,26,34],"requirement":[11],"of":[12,45,55,68,99],"maintaining":[13],"a":[14,42,51,86,92,111],"stable":[15],"solution":[16],"impacts":[17],"approximation.":[19],"particular,":[21],"seek":[23],"bounds":[24,76],"on":[25],"best-possible":[27],"approximation":[28],"ratio":[29],"that":[30,90],"is":[31,36],"attainable":[32],"when":[33],"algorithm":[35,89],"allowed":[37],"to":[38],"make,":[39],"at":[40],"most,":[41],"constant":[43],"number":[44],"updates":[46],"per":[47],"step.":[48],"We":[49],"show":[50],"tight":[52],"information-theoretic":[53,97],"bound":[54,67],"2/3":[56],"for":[57,70,101,122],"general":[58],"monotone":[59],"functions":[61],"an":[63,96],"improved":[64],"(also":[65],"tight)":[66],"3/4":[69],"coverage":[71],"functions.":[72],"Since":[73],"both":[74,118],"these":[75],"are":[77],"attained":[78],"by":[79],"non":[80],"poly-time":[81,87,123],"algorithms,":[82,117],"also":[84],"give":[85],"randomized":[88,116],"achieves":[91],"0.51-approximation.":[93],"Combined":[94],"with":[95],"hardness":[98],"1/2":[100],"deterministic":[102,114],"algorithms":[103],"from":[104],"prior":[105],"our":[107],"work":[108],"thus":[109],"shows":[110],"separation":[112],"between":[113],"information":[119],"theoretically":[120],"algorithms.":[124]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-06-16T00:00:00"}