{"id":"https://openalex.org/W7163884335","doi":"https://doi.org/10.4230/lipics.swat.2026.8","title":"Submodular Max-Min Allocation Under Identical Valuations","display_name":"Submodular Max-Min Allocation Under Identical Valuations","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163884335","doi":"https://doi.org/10.4230/lipics.swat.2026.8"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26044","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.8/LIPIcs.SWAT.2026.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.8/LIPIcs.SWAT.2026.8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109725541","display_name":"Kimon Boehmer","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]},{"id":"https://openalex.org/I4210129409","display_name":"Institut de Biologie de l'\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/03mxktp47","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I154526488","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210096427","https://openalex.org/I4210129409"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Boehmer, Kimon","raw_affiliation_strings":["DIENS, \u00c9cole normale sup\u00e9rieure, PSL University, Paris, France","LIP, ENS Lyon, France"],"raw_orcid":"https://orcid.org/0009-0002-5831-6158","affiliations":[{"raw_affiliation_string":"DIENS, \u00c9cole normale sup\u00e9rieure, PSL University, Paris, France","institution_ids":["https://openalex.org/I4210129409","https://openalex.org/I2746051580"]},{"raw_affiliation_string":"LIP, ENS Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109725541"],"corresponding_institution_ids":["https://openalex.org/I113428412","https://openalex.org/I2746051580","https://openalex.org/I4210129409","https://openalex.org/I4210144566"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95582226,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.5522000193595886,"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.5522000193595886,"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.2881999909877777,"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/T11182","display_name":"Auction Theory and Applications","score":0.05620000138878822,"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/submodular-set-function","display_name":"Submodular set function","score":0.9560999870300293},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8240000009536743},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6298999786376953},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48429998755455017},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.47380000352859497},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4523000121116638},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.4510999917984009},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42640000581741333}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9560999870300293},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8240000009536743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7426000237464905},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6298999786376953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5852000117301941},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48429998755455017},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.47380000352859497},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4523000121116638},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42640000581741333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4023999869823456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4016999900341034},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3725999891757965},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.36419999599456787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3125},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26044","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.8/LIPIcs.SWAT.2026.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.8","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26044","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.8/LIPIcs.SWAT.2026.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163884335.pdf","grobid_xml":"https://content.openalex.org/works/W7163884335.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,25,44,47,51,62,69,83,98,102,116,125,131,138,141],"problem":[2,60],"of":[3,12,16,27,34,43,87,101],"Submodular":[4],"Max-Min":[5],"Allocation,":[6],"we":[7,96,123,153],"are":[8],"given":[9,151],"a":[10,14,28,31,75,80,112,119,155],"set":[11,15],"items,":[13],"players,":[17],"and":[18,93],"monotone":[19],"submodular":[20,135],"valuation":[21,71],"functions":[22],"that":[23,49],"represent":[24],"satisfaction":[26,53],"player":[29],"with":[30],"certain":[32],"subset":[33],"items.":[35],"The":[36],"goal":[37],"is":[38],"to":[39,46,115,140,162],"find":[40],"an":[41],"allocation":[42,160],"items":[45],"players":[48,67,106],"maximizes":[50],"lowest":[52],"among":[54],"all":[55,66],"players.":[56],"We":[57,73],"study":[58,97],"this":[59],"in":[61,149],"special":[63],"case":[64,142],"where":[65,143],"have":[68,107],"same":[70],"function.":[72],"devise":[74],"greedy":[76],"algorithm":[77,157],"which":[78],"gives":[79],"0.4-approximation,":[81],"improving":[82],"previously":[84],"best":[85],"factor":[86],"10/27":[88],"\u2248":[89],"0.37":[90],"by":[91],"Uziahu":[92],"Feige.":[94],"Furthermore,":[95],"integrality":[99,132],"gap":[100,133],"configuration":[103],"LP":[104],"when":[105],"identical":[108,167],"valuations.":[109,136,168],"By":[110],"constructing":[111],"variable":[113],"assignment":[114],"dual":[117],"from":[118],"primal":[120],"integral":[121],"solution,":[122],"give":[124],"first":[126],"constant":[127],"upper":[128],"bound":[129],"on":[130],"for":[134,158],"Generalizing":[137],"result":[139],"players'":[144],"allocations":[145],"must":[146],"be":[147],"independent":[148],"k":[150,163],"matroids,":[152],"derive":[154],"\ud835\udcaa(k)-estimation":[156],"max-min":[159],"subject":[161],"matroid":[164],"constraints":[165],"under":[166]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}