{"id":"https://openalex.org/W2101054149","doi":"https://doi.org/10.1137/s0097539703434966","title":"Fairness Measures for Resource Allocation","display_name":"Fairness Measures for Resource Allocation","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2101054149","doi":"https://doi.org/10.1137/s0097539703434966","mag":"2101054149"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703434966","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703434966","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":["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/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055710645","display_name":"Jon Kleinberg","orcid":"https://orcid.org/0000-0002-1929-2512"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jon Kleinberg","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":2.4,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.89067901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"36","issue":"3","first_page":"657","last_page":"680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6652480959892273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6609393954277039},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.587948203086853},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.540902316570282},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5192677974700928},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45300590991973877},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43364042043685913},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43325892090797424},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4205556809902191},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2377404272556305}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6652480959892273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6609393954277039},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.587948203086853},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.540902316570282},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5192677974700928},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45300590991973877},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43364042043685913},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43325892090797424},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4205556809902191},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2377404272556305},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539703434966","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703434966","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:CiteSeerX.psu:10.1.1.38.4934","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.4934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/Info/People/kleinber/focs00-fair.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.1454","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/people/amitk/focs00-fair.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1973538756","https://openalex.org/W1988328380","https://openalex.org/W2087746279","https://openalex.org/W2089269509","https://openalex.org/W2089615703","https://openalex.org/W2092333800","https://openalex.org/W2123878303","https://openalex.org/W2129391890","https://openalex.org/W2148204686"],"related_works":["https://openalex.org/W4388311650","https://openalex.org/W1974056099","https://openalex.org/W4245343541","https://openalex.org/W2386077341","https://openalex.org/W563589758","https://openalex.org/W5922282","https://openalex.org/W2954004777","https://openalex.org/W2949638731","https://openalex.org/W2951102138","https://openalex.org/W4299447939"],"abstract_inverted_index":{"In":[0],"many":[1],"optimization":[2,82],"problems,":[3,83],"one":[4,30],"seeks":[5],"to":[6,13,147],"allocate":[7],"a":[8,14,58,63,77,122,137,148,152],"limited":[9],"set":[10,15],"of":[11,16,48,67,80,102,154,164],"resources":[12],"individuals":[17],"with":[18,29],"demands.":[19],"Thus,":[20],"such":[21,143],"allocations":[22,56,145],"can":[23],"naturally":[24],"be":[25,128],"viewed":[26],"as":[27],"vectors,":[28],"coordinate":[31],"representing":[32],"each":[33],"individual.":[34],"Motivated":[35],"by":[36],"work":[37],"in":[38,57,76,91,98,108,157],"network":[39],"routing":[40],"and":[41,71,88,160],"bandwidth":[42,89],"assignment,":[43],"we":[44,72],"consider":[45],"the":[46,99,139,162],"problem":[47,117],"producing":[49],"solutions":[50],"that":[51,105,131],"simultaneously":[52,132],"approximate":[53],"all":[54,134],"feasible":[55,166],"coordinate\u2010wise":[59],"sense.":[60],"This":[61],"is":[62,120],"very":[64],"strong":[65],"type":[66],"\u201cglobal\u201d":[68],"approximation":[69,103],"guarantee,":[70],"explore":[73],"its":[74],"consequences":[75],"wide":[78],"range":[79],"discrete":[81],"including":[84],"facility":[85],"location,":[86],"scheduling,":[87],"assignment":[90],"networks.":[92],"A":[93],"fundamental":[94,155],"issue\u2014one":[95],"not":[96,113],"encountered":[97],"traditional":[100],"design":[101],"algorithms\u2014is":[104],"good":[106,144],"approximations":[107],"this":[109],"global":[110],"sense":[111],"need":[112],"exist":[114],"for":[115],"every":[116],"instance;":[118],"there":[119,126],"no":[121],"priori":[123],"reason":[124],"why":[125],"should":[127],"an":[129],"allocation":[130],"approximates":[133],"others.":[135],"As":[136],"result,":[138],"existential":[140],"questions":[141],"concerning":[142],"lead":[146],"new":[149],"perspective":[150],"on":[151,161],"number":[153],"problems":[156],"resource":[158],"allocation,":[159],"structure":[163],"their":[165],"solutions.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}