{"id":"https://openalex.org/W6941227781","doi":"https://doi.org/10.13016/i3qj-a4ok","title":"On Algorithmic Fairness and Stochastic Models for Combinatorial Optimization and Unsupervised Machine Learning","display_name":"On Algorithmic Fairness and Stochastic Models for Combinatorial Optimization and Unsupervised Machine Learning","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6941227781","doi":"https://doi.org/10.13016/i3qj-a4ok"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/29596","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/29596","pdf_url":"https://drum.lib.umd.edu/bitstreams/a2a5d714-2137-454b-b8ed-e980aa3b4e8e/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drum.lib.umd.edu/bitstreams/a2a5d714-2137-454b-b8ed-e980aa3b4e8e/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tsepenekas, Leonidas","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tsepenekas, Leonidas","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":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10451","display_name":"Mycorrhizal Fungi and Plant Interactions","score":0.5561000108718872,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10451","display_name":"Mycorrhizal Fungi and Plant Interactions","score":0.5561000108718872,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.11429999768733978,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10825","display_name":"Plant Pathogens and Fungal Diseases","score":0.047200001776218414,"subfield":{"id":"https://openalex.org/subfields/1307","display_name":"Cell Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.7106000185012817},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6161999702453613},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5644000172615051},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5379999876022339},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4244000017642975},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3921999931335449},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.3813999891281128},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35510000586509705}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7106000185012817},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6234999895095825},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6161999702453613},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5975000262260437},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5644000172615051},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5547999739646912},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5379999876022339},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4244000017642975},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3921999931335449},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3813999891281128},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34709998965263367},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.3391000032424927},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3246000111103058},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/29596","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/29596","pdf_url":"https://drum.lib.umd.edu/bitstreams/a2a5d714-2137-454b-b8ed-e980aa3b4e8e/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},{"id":"doi:10.13016/i3qj-a4ok","is_oa":true,"landing_page_url":"https://doi.org/10.13016/i3qj-a4ok","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Collection"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/29596","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/29596","pdf_url":"https://drum.lib.umd.edu/bitstreams/a2a5d714-2137-454b-b8ed-e980aa3b4e8e/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.4428401589393616}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6941227781.pdf","grobid_xml":"https://content.openalex.org/works/W6941227781.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Combinatorial":[0],"optimization":[1,128],"and":[2,11,30,77,105,361,383,408],"unsupervised":[3],"machine":[4,107],"learning":[5,108],"problems":[6,18,29,31,280,348,373,407],"have":[7],"been":[8,378],"extensively":[9],"studied":[10,379],"are":[12,27,157],"relatively":[13],"well-understood.":[14],"Examples":[15],"of":[16,32,39,51,83,86,103,114,155,202,223,252,271,284,305,321,353,371,416],"such":[17,181],"that":[19,126,137,220,374,392],"play":[20],"a":[21,74,111,216,227,249,293,306,309,318,322,334,350,369,403],"central":[22],"role":[23],"in":[24,35,43,88,100,106,147,159,185,226,308,337,380,412],"this":[25,44,160,230,272,328,365,385],"work":[26,161,332],"clustering":[28,169,372],"finding":[33],"cuts":[34],"graphs.":[36],"The":[37,66,179,197,238],"goal":[38,298],"the":[40,52,78,81,89,96,101,117,124,141,144,148,192,246,263,268,282,302,341,357,381,400,413],"research":[41,410],"presented":[42],"dissertation":[45,329,401],"is":[46,194,204,299],"to":[47,73,123,133,187,206,278,300],"introduce":[48,233],"novel":[49,167,235,389],"variants":[50,59],"aforementioned":[53],"problems,":[54],"by":[55,164],"generalizing":[56,279],"their":[57],"classic":[58],"into":[60],"two,":[61],"not":[62,376],"necessarily":[63],"disjoint,":[64],"directions.":[65],"first":[67,180,239],"direction":[68],"involves":[69,80],"incorporating":[70],"fairness":[71,156],"aspects":[72],"problem's":[75,97],"specifications,":[76],"second":[79,193,247],"introduction":[82,283],"some":[84],"form":[85],"randomness":[87,184],"problem":[90,219,231,313],"definition,":[91],"e.g.,":[92],"stochastic":[93,303,319,338,343],"uncertainty":[94],"about":[95],"parameters.":[98],"Fairness":[99],"design":[102],"algorithms":[104,173,258],"has":[109],"received":[110],"significant":[112],"amount":[113],"attention":[115,277],"during":[116],"last":[118],"few":[119],"years,":[120],"mainly":[121],"due":[122],"realization":[125],"standard":[127],"approaches":[129],"can":[130,138,314],"frequently":[131],"lead":[132],"severely":[134],"unfair":[135],"outcomes,":[136],"potentially":[139],"hurt":[140],"individuals":[142,209],"or":[143],"groups":[145],"involved":[146],"corresponding":[149],"application.":[150],"As":[151],"far":[152],"as":[153,317],"considerations":[154],"concerned,":[158],"we":[162,213,232,256,274,288,367,387],"begin":[163],"presenting":[165],"two":[166,234],"individually-fair":[168],"models,":[170],"together":[171],"with":[172,174,259,345,402],"provable":[175,260],"guarantees":[176,261],"for":[177,262,292,384],"them.":[178],"model":[182],"exploits":[183],"order":[186],"provide":[188,393],"fair":[189,236],"solutions,":[190],"while":[191,245],"purely":[195],"deterministic.":[196],"high-level":[198],"motivation":[199],"behind":[200],"both":[201],"them":[203],"trying":[205],"treat":[207],"similar":[208],"similarly.":[210],"Moving":[211],"forward,":[212],"focus":[214],"on":[215,242,333,405],"graph":[217,324],"cut":[218,325],"captures":[221],"situations":[222],"disaster":[224],"containment":[225],"network.":[228,311],"For":[229],"variants.":[237,266],"variant":[240],"focuses":[241],"demographic":[243],"fairness,":[244],"considers":[248],"probabilistic":[250],"notion":[251],"individual":[253],"fairness.":[254,418],"Again,":[255],"give":[257],"newly":[264],"introduced":[265],"In":[267,364],"next":[269],"part":[270],"thesis":[273],"turn":[275],"our":[276],"through":[281],"stochasticity.":[285],"At":[286],"first,":[287],"present":[289,368],"algorithmic":[290,390,417],"results":[291],"computational":[294],"epidemiology":[295],"problem,":[296],"whose":[297],"control":[301],"diffusion":[304],"disease":[307],"contact":[310],"This":[312],"be":[315],"interpreted":[316],"generalization":[320],"static":[323],"problem.":[326],"Finally,":[327],"also":[330],"includes":[331],"well-known":[335],"paradigm":[336],"optimization,":[339],"namely":[340],"two-stage":[342],"setting":[344],"recourse.":[346],"Two-stage":[347],"capture":[349],"wide":[351],"variety":[352],"applications":[354],"revolving":[355],"around":[356],"trade-off":[358],"between":[359],"provisioning":[360],"rapid":[362],"response.":[363],"setting,":[366],"family":[370,386],"had":[375],"yet":[377],"literature,":[382],"show":[388],"techniques":[391],"constant":[394],"factor":[395],"approximation":[396],"algorithms.":[397],"We":[398],"conclude":[399],"discussion":[404],"open":[406],"future":[409],"directions":[411],"general":[414],"area":[415]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}