{"id":"https://openalex.org/W2952594261","doi":"https://doi.org/10.1145/3328526.3329649","title":"High-Multiplicity Fair Allocation","display_name":"High-Multiplicity Fair Allocation","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2952594261","doi":"https://doi.org/10.1145/3328526.3329649","mag":"2952594261"},"language":"en","primary_location":{"id":"doi:10.1145/3328526.3329649","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3328526.3329649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077431744","display_name":"Robert Bredereck","orcid":"https://orcid.org/0000-0002-6303-6276"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Robert Bredereck","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035960508","display_name":"Andrzej Kaczmarczyk","orcid":"https://orcid.org/0000-0003-1401-0157"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrzej Kaczmarczyk","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":8.5891,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.97054632,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"505","last_page":"523"},"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.9994999766349792,"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.9994999766349792,"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.9950000047683716,"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"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9858999848365784,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8132256269454956},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6571904420852661},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6293190717697144},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6290879249572754},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.577886700630188},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5472471714019775},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.5377578735351562},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.537494957447052},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5188747048377991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47926875948905945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4426405131816864},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42557865381240845},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42285001277923584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3211784064769745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1917763650417328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16952723264694214}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8132256269454956},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6571904420852661},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6293190717697144},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6290879249572754},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.577886700630188},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5472471714019775},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.5377578735351562},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.537494957447052},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5188747048377991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47926875948905945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4426405131816864},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42557865381240845},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42285001277923584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3211784064769745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1917763650417328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16952723264694214},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3328526.3329649","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3328526.3329649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2003735353","display_name":null,"funder_award_id":"NI 369/19, BR 5207/1, NI 369/15","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1513894211","https://openalex.org/W1573064394","https://openalex.org/W1588457598","https://openalex.org/W1779426617","https://openalex.org/W2061881283","https://openalex.org/W2079854492","https://openalex.org/W2090960684","https://openalex.org/W2103658959","https://openalex.org/W2114616381","https://openalex.org/W2121240598","https://openalex.org/W2150409561","https://openalex.org/W2168633992","https://openalex.org/W2293616868","https://openalex.org/W2346164124","https://openalex.org/W2484891765","https://openalex.org/W2608239929","https://openalex.org/W2889304581","https://openalex.org/W2963034101","https://openalex.org/W2997728797","https://openalex.org/W3015027015","https://openalex.org/W3087878218","https://openalex.org/W3103589466","https://openalex.org/W3121437753","https://openalex.org/W4233558979"],"related_works":["https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"We":[0,177],"study":[1],"the":[2,9,87,104,159,169,189],"(parameterized)":[3],"computational":[4],"complexity":[5],"of":[6,11,14,28,35,83,99,121,139,173,191,198],"problems":[7,29,56,102],"in":[8,52,74,103,188,201],"context":[10],"fair":[12,100,205],"allocations":[13,34],"indivisible":[15],"goods.":[16],"More":[17,127],"specifically,":[18,128],"we":[19,58,78,129],"show":[20],"fixed-parameter":[21,147],"tractability":[22,148],"results":[23,131],"for":[24,50],"a":[25,96,136,165,181],"broad":[26],"set":[27,98],"concerned":[30],"with":[31,61,154],"envy-free,":[32],"Pareto-efficient":[33],"items":[36],"(with":[37],"agent-specific":[38],"utility":[39,68],"functions)":[40],"to":[41,116,135],"agents.":[42],"In":[43],"principle,":[44],"this":[45],"implies":[46],"efficient":[47],"exact":[48],"algorithms":[49],"these":[51,185],"general":[53],"computationally":[54],"intractable":[55],"whenever":[57],"face":[59],"instances":[60],"few":[62],"agents":[63],"and":[64,168,179],"low":[65],"maximum":[66],"(absolute)":[67],"values.":[69],"This":[70],"holds":[71],"true":[72],"also":[73],"high-multiplicity":[75],"settings":[76],"where":[77],"may":[79,196],"have":[80],"high":[81],"numbers":[82],"identical":[84],"items.":[85],"On":[86],"technical":[88,113],"side,":[89],"our":[90,111],"approach":[91],"provides":[92],"algorithmic":[93],"meta-theorems":[94],"covering":[95],"rich":[97],"allocation":[101],"additive":[105],"preferences":[106],"model.":[107],"To":[108],"achieve":[109],"this,":[110],"main":[112],"contribution":[114],"is":[115],"make":[117],"an":[118],"elaborate":[119],"use":[120],"tools":[122],"from":[123],"integer":[124,192],"linear":[125,193],"programming.":[126],"exploit":[130,180],"originally":[132],"going":[133,203],"back":[134],"famous":[137],"theorem":[138],"Lenstra":[140],"[Math.":[141],"Oper.":[142],"Res.":[143],"1983]":[144],"concerning":[145],"(the":[146],"of)":[149],"Integer":[150],"Linear":[151],"Programs":[152],"(ILPs)":[153],"bounded":[155],"dimension":[156,160],"(that":[157],"is,":[158],"shall":[161],"be":[162,197],"considered":[163],"as":[164],"(small)":[166],"parameter)":[167],"more":[170],"recent":[171],"framework":[172],"(combinatorial)":[174],"N-fold":[175],"ILPs.":[176],"reveal":[178],"fruitful":[182],"interaction":[183],"between":[184],"two":[186],"cornerstones":[187],"theory":[190],"programming,":[194],"which":[195],"independent":[199],"interest":[200],"applications":[202],"beyond":[204],"allocations.":[206]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}