{"id":"https://openalex.org/W3008554935","doi":"https://doi.org/10.1137/20m1387493","title":"Consensus-Halving: Does It Ever Get Easier?","display_name":"Consensus-Halving: Does It Ever Get Easier?","publication_year":2023,"publication_date":"2023-04-04","ids":{"openalex":"https://openalex.org/W3008554935","doi":"https://doi.org/10.1137/20m1387493","mag":"3008554935"},"language":"en","primary_location":{"id":"doi:10.1137/20m1387493","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1387493","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/2002.11437","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065488177","display_name":"Aris Filos-Ratsikas","orcid":"https://orcid.org/0000-0001-7868-8114"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Aris Filos-Ratsikas","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-7868-8114","affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065826113","display_name":"Alexandros Hollender","orcid":"https://orcid.org/0000-0001-5255-9349"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexandros Hollender","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, OX1 3QD, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-5255-9349","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, OX1 3QD, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059304673","display_name":"Katerina Sotiraki","orcid":"https://orcid.org/0009-0002-5372-4849"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katerina Sotiraki","raw_affiliation_strings":["University of California Berkeley, Berkeley, CA 94709 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Berkeley, Berkeley, CA 94709 USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083461583","display_name":"Manolis Zampetakis","orcid":"https://orcid.org/0009-0005-4967-5927"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manolis Zampetakis","raw_affiliation_strings":["University of California Berkeley, Berkeley, CA 94709 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Berkeley, Berkeley, CA 94709 USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5065488177"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.9699,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77393123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"52","issue":"2","first_page":"412","last_page":"451"},"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.9991000294685364,"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.9991000294685364,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9980000257492065,"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/T11182","display_name":"Auction Theory and Applications","score":0.9958999752998352,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7766488790512085},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6160537600517273},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.5560998916625977},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5133858919143677},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4991459846496582},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48605257272720337},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.43924978375434875},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.43391120433807373},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4302670359611511},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40057373046875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36434853076934814},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28401967883110046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27049019932746887},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12241271138191223}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7766488790512085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6160537600517273},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.5560998916625977},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5133858919143677},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4991459846496582},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48605257272720337},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.43924978375434875},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.43391120433807373},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4302670359611511},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40057373046875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36434853076934814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28401967883110046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27049019932746887},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12241271138191223},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/20m1387493","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1387493","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:2002.11437","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.11437","pdf_url":"https://arxiv.org/pdf/2002.11437","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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"},{"id":"pmh:oai:pure.ed.ac.uk:publications/01b381fe-29dc-4ec3-b7c8-e7f5ccd10eac","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/01b381fe-29dc-4ec3-b7c8-e7f5ccd10eac","pdf_url":"https://www.research.ed.ac.uk/files/302458158/Consensus_Halving_Easier_FILOS_RATSIKAS_DOA14102022_AFV.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"Filos-Ratsikas, A, Hollender, A, Sotiraki, K & Zampetakis, M 2023, 'Consensus-Halving: Does It Ever Get Easier?', SIAM Journal on Computing, vol. 52, no. 2, pp. 563-602. https://doi.org/10.1137/20M1387493","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146185","is_oa":true,"landing_page_url":"https://dspace.mit.edu/bitstream/1721.1/146185/1/3391403.3399527.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 21st ACM Conference on Economics and Computation","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:379c48bd-ed93-4dd6-a926-d0e08fc467ad","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:379c48bd-ed93-4dd6-a926-d0e08fc467ad","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Journal article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/01b381fe-29dc-4ec3-b7c8-e7f5ccd10eac","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/01b381fe-29dc-4ec3-b7c8-e7f5ccd10eac","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"Filos-Ratsikas, A, Hollender, A, Sotiraki, K & Zampetakis, M 2023, 'Consensus-Halving: Does It Ever Get Easier?', SIAM Journal on Computing, vol. 52, no. 2, pp. 563-602. https://doi.org/10.1137/20M1387493","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2002.11437","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.11437","pdf_url":"https://arxiv.org/pdf/2002.11437","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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/G1156209512","display_name":"CAREER: Computing on Encrypted Data","funder_award_id":"1350619","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5287573786","display_name":null,"funder_award_id":"1892947","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7317372244","display_name":"Investigating problems in the complexity class TFNP","funder_award_id":"1892947","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8679789787","display_name":null,"funder_award_id":"1617730","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"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332503","display_name":"Lincoln Laboratory, Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W934230699","https://openalex.org/W1565527378","https://openalex.org/W1854782908","https://openalex.org/W1963607038","https://openalex.org/W1980813953","https://openalex.org/W1991624978","https://openalex.org/W1997961920","https://openalex.org/W2002373723","https://openalex.org/W2016462171","https://openalex.org/W2022749618","https://openalex.org/W2057913812","https://openalex.org/W2062471467","https://openalex.org/W2067482046","https://openalex.org/W2067755836","https://openalex.org/W2068845983","https://openalex.org/W2140799001","https://openalex.org/W2169359757","https://openalex.org/W2170388543","https://openalex.org/W2331171996","https://openalex.org/W2460378253","https://openalex.org/W2625867694","https://openalex.org/W2753259608","https://openalex.org/W2791150045","https://openalex.org/W2898884066","https://openalex.org/W2963065304","https://openalex.org/W2963086090","https://openalex.org/W2963674652","https://openalex.org/W2963831880","https://openalex.org/W2965985967","https://openalex.org/W2966442265","https://openalex.org/W2976501052","https://openalex.org/W2989818063","https://openalex.org/W2991500167","https://openalex.org/W3014065175","https://openalex.org/W3045663689","https://openalex.org/W3046614992","https://openalex.org/W3047060986","https://openalex.org/W3101401168","https://openalex.org/W3140135908","https://openalex.org/W3172271059","https://openalex.org/W3175920190","https://openalex.org/W4206085806","https://openalex.org/W4236082126"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1516574938","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W1976468483","https://openalex.org/W2480116122","https://openalex.org/W2398738602","https://openalex.org/W2965171438"],"abstract_inverted_index":{"<div>In":[0],"the <span":[1],"tabindex=\"0\"":[2,13,37,42,58,67,238,242,252,276,298,301],"data-mathml=\"<math":[3,14,38,43,59,68,239,243,253,277,299,302],"xmlns="http://www.w3.org/1998/Math/MathML"><mi>ε</mi></math>\">ε</span>-<em>Consensus-Halving</em> problem,":[4],"a":[5,34,117,155,193,232,248,270],"fundamental":[6],"problem":[7,73,110,131,280],"in":[8,198,207],"fair":[9],"division,":[10],"there":[11],"are <span":[12],"xmlns="http://www.w3.org/1998/Math/MathML"><mi>n</mi></math>\">n</span> agents":[15],"with":[16,185],"valuations":[17],"over":[18],"the":[19,23,28,53,62,106,112,126,130,139,149,158,179,204,226,265,274],"interval":[20,29],"[0,1],":[21],"and":[22,32,61,79,163,209,284],"goal":[24],"is":[25,197,264,305],"to":[26,45,104,128,134,178],"divide":[27],"into":[30],"pieces":[31],"assign":[33],"label":[35],"“<span":[36,41,57,66],"xmlns="http://www.w3.org/1998/Math/MathML"><mo>+</mo></math>\">+</span>”":[39,60],"or":[40],"xmlns="http://www.w3.org/1998/Math/MathML"><mo>−</mo></math>\">−</span>”":[44,69],"each":[46],"piece,":[47],"such":[48],"that":[49],"every":[50],"agent":[51],"values":[52],"total":[54,63],"amount":[55,64],"of":[56,65,82,89,93,100,141,157,161,166,173,212,219,260,272],"almost":[70],"equally.":[71],"The":[72],"was":[74],"recently":[75],"proven":[76],"by":[77],"Filos-Ratsikas":[78,162,208],"Goldberg":[80,164,210],"[<em>Proceedings":[81,165,211],"the</em> 50<em>th":[83],"Annual":[84,95,168,214],"ACM":[85,96,169,215],"Symposium":[86,97,170,216],"on":[87,98,171,217],"Theory":[88,99,172,218],"Computing,</em> 2018,":[90],"pp.":[91,102,176,221,291],"51–64; <em>Proceedings":[92],"the</em> 51<em>st":[94,167,213],"Computing,</em> 2019,":[101,220],"638–649]":[103,177],"be":[105],"first":[107,266],"“natural”":[108],"complete":[109],"for":[111,236,269],"computational":[113],"class":[114,140],"PPA,":[115],"answering":[116],"decade-old":[118],"open":[119],"question.":[120],"In":[121,293],"this":[122,145,190],"paper,":[123],"we":[124,147,153,224,295],"examine":[125],"extent":[127],"which":[129,196],"becomes":[132],"easy":[133],"solve":[135],"if":[136],"one":[137,206],"restricts":[138],"valuation":[142],"functions.":[143],"To":[144],"end,":[146],"provide":[148,231],"following":[150],"contributions.":[151],"First,":[152],"obtain":[154,189],"strengthening":[156],"PPA-hardness":[159],"result":[160,191,268],"Computing</em>,":[174],"2019,":[175],"case":[180,227],"when":[181],"agents":[182],"have <em>piecewise":[183],"uniform</em> valuations":[184],"only <em>two":[186],"blocks</em>.":[187],"We":[188],"via":[192],"new":[194,262],"reduction,":[195],"fact":[199],"conceptually":[200],"much":[201],"simpler":[202],"than":[203],"corresponding":[205],"638–649].":[222],"Then,":[223],"consider":[225],"of <em>single-block":[228],"(uniform)":[229],"valuations</em> and":[230],"parameterized":[233],"polynomial-time":[234,249],"algorithm":[235,250],"solving <span":[237],"xmlns="http://www.w3.org/1998/Math/MathML"><mi>ε</mi></math>\">ε</span>-<em>Consensus-Halving</em> for":[240],"any <span":[241],"xmlns="http://www.w3.org/1998/Math/MathML"><mi>ε</mi></math>\">ε</span>,":[244],"as":[245,247],"well":[246],"for <span":[251],"xmlns="http://www.w3.org/1998/Math/MathML"><mi>ε</mi><mo>=</mo><mn>1</mn><mrow":[254],"class="MJX-TeXAtom-ORD"><mo>/</mo></mrow><mn>2</mn></math>\">ε=1/2</span>.":[255],"Finally,":[256],"an":[257],"important":[258],"application":[259],"our":[261],"techniques":[263],"hardness":[267],"generalization":[271],"Consensus-Halving,":[273],"Consensus-<span":[275],"xmlns="http://www.w3.org/1998/Math/MathML"><mn>1</mn><mrow":[278,303],"class="MJX-TeXAtom-ORD"><mo>/</mo></mrow><mi>k</mi></math>\">1/k1</span>-Division":[279],"[F.":[281],"W.":[282],"Simmons":[283],"F.":[285],"E.":[286],"Su, <em>Math.":[287],"Social":[288],"Sci.,</em> 45":[289],"(2003),":[290],"15–25].":[292],"particular,":[294],"prove":[296],"that <span":[297],"xmlns="http://www.w3.org/1998/Math/MathML"><mi>ε</mi></math>\">ε</span>-Consensus-<span":[300],"class="MJX-TeXAtom-ORD"><mo>/</mo></mrow><mn>3</mn></math>\">1/3</span>-Division":[304],"PPAD-hard.</div>":[306]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}