{"id":"https://openalex.org/W4413749687","doi":"https://doi.org/10.23919/wiopt66569.2025.11123370","title":"Information-Theoretic Fairness with a Bounded Statistical Parity Constraint","display_name":"Information-Theoretic Fairness with a Bounded Statistical Parity Constraint","publication_year":2025,"publication_date":"2025-05-26","ids":{"openalex":"https://openalex.org/W4413749687","doi":"https://doi.org/10.23919/wiopt66569.2025.11123370"},"language":"en","primary_location":{"id":"doi:10.23919/wiopt66569.2025.11123370","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt66569.2025.11123370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","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/A5068807935","display_name":"Amirreza Zamani","orcid":"https://orcid.org/0000-0001-9296-4939"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Amirreza Zamani","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119449097","display_name":"Abolfazl Changizi","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Abolfazl Changizi","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080600326","display_name":"Ragnar Thobaben","orcid":"https://orcid.org/0000-0001-9307-484X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ragnar Thobaben","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041348422","display_name":"Mikael Skoglund","orcid":"https://orcid.org/0000-0002-7926-5081"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Skoglund","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering,Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":6.282,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.96893705,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.7038000226020813,"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"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.7038000226020813,"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/T10646","display_name":"Experimental Behavioral Economics Studies","score":0.6902999877929688,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.6723999977111816,"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/bounded-function","display_name":"Bounded function","score":0.7043668627738953},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.5871222019195557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.537550687789917},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5013864040374756},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.42145836353302},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3801356256008148},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3773237466812134},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3766515851020813},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.21293014287948608},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06658777594566345}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7043668627738953},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.5871222019195557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.537550687789917},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5013864040374756},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.42145836353302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3801356256008148},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3773237466812134},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3766515851020813},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.21293014287948608},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06658777594566345},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/wiopt66569.2025.11123370","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt66569.2025.11123370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1981029888","https://openalex.org/W2071342505","https://openalex.org/W2077145963","https://openalex.org/W2099111195","https://openalex.org/W2109394932","https://openalex.org/W2161001052","https://openalex.org/W2167372639","https://openalex.org/W2886523564","https://openalex.org/W2963412800","https://openalex.org/W2967916697","https://openalex.org/W2976116280","https://openalex.org/W3108844855","https://openalex.org/W3121148053","https://openalex.org/W3121783531","https://openalex.org/W3123181209","https://openalex.org/W3127536994","https://openalex.org/W3173593876","https://openalex.org/W3174416938","https://openalex.org/W3182521736","https://openalex.org/W3215441929","https://openalex.org/W4249192582","https://openalex.org/W4366392943","https://openalex.org/W4382365054","https://openalex.org/W4387789705","https://openalex.org/W4389332325","https://openalex.org/W4390098162","https://openalex.org/W4390489177","https://openalex.org/W4401692433","https://openalex.org/W4405909470","https://openalex.org/W4406796111"],"related_works":["https://openalex.org/W2472109360","https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W2462216790","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W2136374310","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W2006389905"],"abstract_inverted_index":{"In":[0,73],"this":[1,74,229],"paper,":[2],"we":[3,61,76,114,168,214],"study":[4,136,215],"an":[5,21],"information-theoretic":[6],"problem":[7,201,226],"of":[8,118,139,180,237],"designing":[9],"a":[10,28,42,45,70,89,177,222,252],"fair":[11],"representation":[12],"that":[13,53,96,204],"attains":[14],"bounded":[15,46,90,105,241,244],"statistical":[16,47,106],"(demographic)":[17],"parity.":[18],"More":[19],"specifically,":[20],"agent":[22,40],"uses":[23],"some":[24,34],"useful":[25,159],"data$X$to":[26],"solve":[27],"task$T$.":[29],"Since":[30],"both$X$and$T$are":[31],"correlated":[32],"with":[33,240],"sensitive":[35,161,249],"attribute":[36,250],"or":[37],"secret$S$,":[38],"the":[39,63,78,81,85,104,119,124,137,140,151,170,181,199,210,216,248],"designs":[41],"representation$Y$that":[43,79],"satisfies":[44],"parity":[48,67,107],"and/or":[49],"privacy":[50,246],"leakage":[51,207,242],"constraint,":[52,95],"is,":[54,97],"such":[55],"that$I(Y;":[56,99],"S)":[57,109],"\\leq":[58,101,110],"\\epsilon$.":[59,111],"Here,":[60],"relax":[62],"perfect":[64,164],"demographic":[65,165],"(statistical)":[66],"and":[68,123,135,186,195,202,218,243],"consider":[69],"bounded-parity":[71],"constraint.":[72],"work,":[75],"design":[77,239],"maximizes":[80],"mutual":[82],"information$I(Y;":[83],"T)$about":[84],"task":[86],"while":[87],"satisfying":[88],"compression":[91],"(or":[92],"encoding":[93],"rate)":[94],"ensuring":[98],"X)":[100],"r$.":[102],"Simultaneously,$Y$satisfies":[103],"constraint$I(Y;":[108],"To":[112],"design$Y$,":[113],"use":[115,156],"extended":[116],"versions":[117],"Functional":[120,126,183],"Representation":[121,127,184],"Lemma":[122,128,185],"Strong":[125,182],"which":[129],"are":[130],"based":[131],"on":[132],"randomization":[133,157],"techniques":[134],"tightness":[138],"obtained":[141],"bounds":[142,153,197,217],"in":[143,221,228],"special":[144],"cases.":[145],"The":[146,225],"main":[147,200],"idea":[148],"to":[149,155],"derive":[150],"lower":[152,196],"is":[154],"over":[158],"data$X$or":[160],"data$S$.":[162],"Considering":[163],"parity,":[166],"i.e.,$\\epsilon=0$,":[167],"improve":[169,209],"existing":[171],"results":[172],"(lower":[173],"bounds)":[174],"by":[175],"using":[176],"tighter":[178],"version":[179],"propose":[187,193],"new":[188],"upper":[189,194],"bounds.":[190],"We":[191],"then":[192],"for":[198],"show":[203],"allowing":[205],"non-zero":[206],"can":[208,231],"attained":[211],"utility.":[212],"Finally,":[213],"compare":[219],"them":[220],"numerical":[223],"example.":[224],"studied":[227],"paper":[230],"also":[232],"be":[233],"interpreted":[234],"as":[235,251],"one":[236],"code":[238],"rate":[245],"considering":[247],"secret.":[253]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}