{"id":"https://openalex.org/W1992678640","doi":null,"title":"On allocations that maximize fairness","display_name":"On allocations that maximize fairness","publication_year":2008,"publication_date":"2008-01-20","ids":{"openalex":"https://openalex.org/W1992678640","mag":"1992678640"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.119.9887","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.9887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~feige/mypapers/santaclaus.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392","observed_orcids":["https://orcid.org/0009-0006-3749-4392"]},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Uriel Feige","raw_affiliation_strings":["Weizmann Inst., Rehovot (Israel)"],"raw_orcid":"https://orcid.org/0009-0006-3749-4392","affiliations":[{"raw_affiliation_string":"Weizmann Inst., Rehovot (Israel)","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013190102"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":20.5377,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.99137911,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"287","last_page":"293"},"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.8511000275611877,"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.8511000275611877,"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.07150000333786011,"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/T12288","display_name":"Optimization and Search Problems","score":0.046799998730421066,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/indivisible-goods","display_name":"indivisible goods","score":0.9020000100135803},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.4659999907016754},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.6660000085830688},{"id":"https://openalex.org/keywords/rounding-technique","display_name":"rounding technique","score":0.43299999833106995},{"id":"https://openalex.org/keywords/fair-division","display_name":"fair division","score":0.578000009059906},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6589999794960022}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8036947846412659},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.6603467464447021},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6431174278259277},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5972546339035034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.555812418460846},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5336153507232666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5220244526863098},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5125710964202881},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4925113618373871},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.49181392788887024},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.469970166683197},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4450942277908325},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4183049201965332},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40776124596595764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3960433006286621},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.358717143535614},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1310248076915741},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.119.9887","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.9887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~feige/mypapers/santaclaus.pdf","raw_type":"text"},{"id":"mag:1992678640","doi":null,"is_oa":false,"landing_page_url":"https://www.wisdom.weizmann.ac.il/~feige/mypapers/santaclaus.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1978593916","https://openalex.org/W2044380699","https://openalex.org/W2068859584","https://openalex.org/W2068871408","https://openalex.org/W2084427019","https://openalex.org/W2133097277"],"related_works":["https://openalex.org/W824171425","https://openalex.org/W2964339632","https://openalex.org/W4253295481","https://openalex.org/W2607725432","https://openalex.org/W4214494873","https://openalex.org/W2095794917","https://openalex.org/W2079854492","https://openalex.org/W7098288640","https://openalex.org/W2836838733","https://openalex.org/W6959735876"],"abstract_inverted_index":{"We":[0,118],"consider":[1],"a":[2,57,61,87,96,135],"problem":[3,14],"known":[4],"as":[5],"the":[6,11,37,44,51,54,68,71,116,121,130],"restricted":[7],"assignment":[8],"version":[9],"of":[10,22,36,64,70,73,75,103,115,123,161],"max-min":[12],"allocation":[13,102,155],"with":[15],"indivisible":[16],"goods.":[17],"There":[18],"are":[19],"n":[20],"items":[21,38,52,76],"various":[23],"nonnegative":[24],"values":[25,74],"and":[26,39,82,94,143],"m":[27,110],"players.":[28],"Every":[29],"player":[30],"is":[31,140,157],"interested":[32],"only":[33],"in":[34,56,127],"some":[35],"has":[40,48],"zero":[41],"value":[42,104,122,132],"for":[43,91,152],"other":[45],"items.":[46],"One":[47],"to":[49,78,133],"distribute":[50],"among":[53],"players":[55],"way":[58],"that":[59,99,120,156],"maximizes":[60,67],"certain":[62],"notion":[63],"fairness,":[65],"namely,":[66],"minimum":[69],"sum":[72],"given":[77],"any":[79],"player.":[80],"Bansal":[81],"Sviridenko":[83],"[STOC":[84],"2006]":[85],"describe":[86],"linear":[88],"programming":[89],"relaxation":[90,126],"this":[92,124],"problem,":[93],"present":[95],"rounding":[97],"technique":[98],"recovers":[100],"an":[101,149,154],"at":[105],"least":[106],"\u2126(log":[107],"log":[108,109,112,113],"/":[111],"m)":[114],"optimum.":[117],"show":[119],"LP":[125],"fact":[128],"approximates":[129],"optimum":[131],"within":[134,158],"constant":[136,159],"factor.":[137],"Our":[138],"proof":[139],"not":[141,145],"constructive":[142],"does":[144],"by":[146],"itself":[147],"provide":[148],"efficient":[150],"algorithm":[151],"finding":[153],"factors":[160],"optimal.":[162],"1":[163]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}