{"id":"https://openalex.org/W4411945983","doi":"https://doi.org/10.1145/3736252.3742621","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","display_name":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","publication_year":2025,"publication_date":"2025-07-02","ids":{"openalex":"https://openalex.org/W4411945983","doi":"https://doi.org/10.1145/3736252.3742621"},"language":"en","primary_location":{"id":"doi:10.1145/3736252.3742621","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3736252.3742621","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742621","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742621","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000823457","display_name":"Masoud Seddighin","orcid":"https://orcid.org/0000-0003-1089-5779"},"institutions":[{"id":"https://openalex.org/I4210127068","display_name":"Pasargad Institute for Advanced Innovative Solutions","ror":"https://ror.org/033mn5m13","country_code":"IR","type":"education","lineage":["https://openalex.org/I4210127068"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Masoud Seddighin","raw_affiliation_strings":["Tehran Institute for Advanced Studies, Tehran, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0003-1089-5779","affiliations":[{"raw_affiliation_string":"Tehran Institute for Advanced Studies, Tehran, Tehran, Iran","institution_ids":["https://openalex.org/I4210127068"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087093711","display_name":"Saeed Seddighin","orcid":"https://orcid.org/0000-0002-3951-7096"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saeed Seddighin","raw_affiliation_strings":["Unaffiliated, Chicago, Illinois, USA"],"raw_orcid":"https://orcid.org/0000-0002-3951-7096","affiliations":[{"raw_affiliation_string":"Unaffiliated, Chicago, Illinois, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000823457"],"corresponding_institution_ids":["https://openalex.org/I4210127068"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2204422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"764","last_page":"782"},"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.9980999827384949,"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.9980999827384949,"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.9944999814033508,"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/T11716","display_name":"Random Matrices and Applications","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.9537186622619629},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7986599802970886},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.746329665184021},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45076239109039307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43412110209465027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4178643226623535},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.34876471757888794},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27994322776794434},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.082842618227005}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.9537186622619629},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7986599802970886},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.746329665184021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45076239109039307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43412110209465027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4178643226623535},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.34876471757888794},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27994322776794434},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.082842618227005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3736252.3742621","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3736252.3742621","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742621","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3736252.3742621","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3736252.3742621","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742621","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.47999998927116394,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411945983.pdf","grobid_xml":"https://content.openalex.org/works/W4411945983.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1542025417","https://openalex.org/W1981973022","https://openalex.org/W1991223607","https://openalex.org/W2028010759","https://openalex.org/W2121240598","https://openalex.org/W2150409561","https://openalex.org/W2346164124","https://openalex.org/W2607725432","https://openalex.org/W2619200939","https://openalex.org/W2787109037","https://openalex.org/W2912276182","https://openalex.org/W3042146543","https://openalex.org/W4236082126","https://openalex.org/W4247772422","https://openalex.org/W4372046852","https://openalex.org/W4385764255","https://openalex.org/W4389454822","https://openalex.org/W4390575963","https://openalex.org/W4399522667"],"related_works":["https://openalex.org/W4288374528","https://openalex.org/W2942373159","https://openalex.org/W4391157351","https://openalex.org/W4245471134","https://openalex.org/W2966385870","https://openalex.org/W4400640026","https://openalex.org/W4283790219","https://openalex.org/W2944528978","https://openalex.org/W3109766892","https://openalex.org/W3182145356"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,25,30],"problem":[3],"of":[4,7,32,72],"fair":[5],"allocation":[6],"indivisible":[8],"goods":[9],"for":[10,19,29,65],"subadditive":[11,23,33,66],"agents.":[12],"While":[13],"constant-MMS":[14],"bounds":[15],"have":[16],"been":[17],"given":[18],"additive":[20],"and":[21,62,75],"fractionally":[22],"agents,":[24],"best":[26],"existential":[27],"bound":[28,47],"case":[31],"agents":[34],"is":[35],"1/O(log":[36],"n":[37],"log":[38,39,51],"n).":[40],"In":[41],"this":[42,46,55],"work,":[43],"we":[44,57,69],"improve":[45],"to":[48],"a":[49],"1/O((log":[50],"n)2)-MMS":[52],"guarantee.":[53],"To":[54],"end,":[56],"introduce":[58],"new":[59],"matching":[60],"techniques":[61],"rounding":[63],"methods":[64],"valuations":[67],"that":[68],"believe":[70],"are":[71],"independent":[73],"interest":[74],"will":[76],"find":[77],"their":[78],"applications":[79],"in":[80],"future":[81],"work.":[82]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}