{"id":"https://openalex.org/W2769989956","doi":"https://doi.org/10.1137/19m1244305","title":"Communication Complexity of Discrete Fair Division","display_name":"Communication Complexity of Discrete Fair Division","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2769989956","doi":"https://doi.org/10.1137/19m1244305","mag":"2769989956"},"language":"en","primary_location":{"id":"doi:10.1137/19m1244305","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1244305","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1711.04066","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Benjamin Plaut","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Plaut","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Tim Roughgarden","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tim Roughgarden","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7379,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82665879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"49","issue":"1","first_page":"206","last_page":"243"},"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.7531999945640564,"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.7531999945640564,"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.14329999685287476,"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/T11031","display_name":"Game Theory and Applications","score":0.026399999856948853,"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/fair-division","display_name":"Fair division","score":0.7932999730110168},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7620000243186951},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.48539999127388},{"id":"https://openalex.org/keywords/division","display_name":"Division (mathematics)","score":0.48240000009536743},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.474700003862381},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4361000061035156},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4108000099658966},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.39890000224113464}],"concepts":[{"id":"https://openalex.org/C184659173","wikidata":"https://www.wikidata.org/wiki/Q1511081","display_name":"Fair division","level":2,"score":0.7932999730110168},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7620000243186951},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C60798267","wikidata":"https://www.wikidata.org/wiki/Q1226939","display_name":"Division (mathematics)","level":2,"score":0.48240000009536743},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4697999954223633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4609000086784363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4388999938964844},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4108000099658966},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.39890000224113464},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.39579999446868896},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.3725000023841858},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.35350000858306885},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27720001339912415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2705000042915344},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/19m1244305","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1244305","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1711.04066","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.04066","pdf_url":"https://arxiv.org/pdf/1711.04066","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1711.04066","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.04066","pdf_url":"https://arxiv.org/pdf/1711.04066","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2878079676","display_name":null,"funder_award_id":"CCF-1524062","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6644343216","display_name":"AF: Small: Connections Between Algorithmic Game Theory, Complexity Theory, and Learning Theory","funder_award_id":"1524062","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"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1980223785","https://openalex.org/W2017970485","https://openalex.org/W2038435918","https://openalex.org/W2063341202","https://openalex.org/W2069259012","https://openalex.org/W2070486524","https://openalex.org/W2088263428","https://openalex.org/W2104334470","https://openalex.org/W2156641215","https://openalex.org/W2161272173","https://openalex.org/W2164749099","https://openalex.org/W3123638799"],"related_works":[],"abstract_inverted_index":{"We":[0,14,37],"initiate":[1],"the":[2,5,19,61,72,80,85,95],"study":[3],"of":[4,8,18,48,63,75,79,98,115,122],"communication":[6,59,96],"complexity":[7,97],"fair":[9,54,101],"division":[10],"with":[11],"indivisible":[12],"goods.":[13],"focus":[15],"on":[16,71,84],"some":[17],"most":[20,78],"well":[21],"studied":[22],"fairness":[23,116],"notions":[24],"(envy-freeness,":[25],"proportionality,":[26],"and":[27,30,35,77,120,127],"approximations":[28],"thereof)":[29],"valuation":[31,118],"classes":[32],"(submodular,":[33],"subadditive,":[34],"unrestricted).":[36],"show":[38],"that":[39,105],"for":[40,112,124],"more":[41],"than":[42],"two":[43,66],"players":[44],"(and":[45],"any":[46],"combination":[47,74,114],"other":[49],"parameters),":[50],"determining":[51,104],"whether":[52,94],"a":[53,100],"allocation":[55,102],"exists":[56],"requires":[57],"exponential":[58],"(in":[60],"number":[62,121],"goods).":[64],"For":[65],"players,":[67,123],"tractability":[68],"depends":[69],"heavily":[70],"specific":[73],"parameters,":[76],"paper":[81],"is":[82,108],"focused":[83],"two-player":[86],"setting.":[87],"Taken":[88],"together,":[89],"our":[90],"results":[91],"completely":[92],"resolve":[93],"computing":[99],"(or":[103],"none":[106],"exists)":[107],"polynomial":[109],"or":[110],"exponential,":[111],"every":[113],"notion,":[117],"class,":[119],"both":[125],"deterministic":[126],"randomized":[128],"protocols.":[129]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2017-12-04T00:00:00"}