{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:16Z","timestamp":1759639036429,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["DMS 1854831"],"award-info":[{"award-number":["DMS 1854831"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112190040"],"award-info":[{"award-number":["HR00112190040"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,21]]},"DOI":"10.1145\/3531146.3533146","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T14:27:10Z","timestamp":1655735230000},"page":"814-823","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fair Representation Clustering with Several Protected Classes"],"prefix":"10.1145","author":[{"given":"Zhen","family":"Dai","sequence":"first","affiliation":[{"name":"University of Chicago, USA"}]},{"given":"Yury","family":"Makarychev","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, USA"}]},{"given":"Ali","family":"Vakilian","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445913"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330987"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055487"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the International Conference on Machine Learning. 405\u2013413","author":"Backurs Arturs","year":"2019","unstructured":"Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, and Tal Wagner. 2019. Scalable Fair Clustering. In Proceedings of the International Conference on Machine Learning. 405\u2013413."},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications","volume":"23","author":"Bandyapadhyay Sayan","year":"2021","unstructured":"Sayan Bandyapadhyay, Fedor\u00a0V. Fomin, and Kirill Simonov. 2021. On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. In Proceedings of the International Colloquium on Automata, Languages, and Programming. 23:1\u201323:15.","journal-title":"Proceedings of the International Colloquium on Automata, Languages, and Programming."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548477"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_8_1","unstructured":"Suman Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair algorithms for clustering. In Advances in Neural Information Processing Systems. 4955\u20134966."},{"key":"e_1_3_2_1_9_1","unstructured":"Ioana\u00a0O Bercea Martin Gro\u00df Samir Khuller Aounon Kumar Clemens R\u00f6sner Daniel\u00a0R Schmidt and Melanie Schmidt. 2019. On the Cost of Essentially Fair Clusterings. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques."},{"key":"e_1_3_2_1_10_1","unstructured":"Matteo B\u00f6hm Adriano Fazzone Stefano Leonardi and Chris Schwiegelshohn. 2020. Fair clustering with multiple colors. arXiv preprint arXiv:2002.07892(2020)."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the International Conference on Machine Learning. 1178\u20131189","author":"Brubach Brian","year":"2020","unstructured":"Brian Brubach, Darshan Chakrabarti, John Dickerson, Samir Khuller, Aravind Srinivasan, and Leonidas Tsepenekas. 2020. A Pairwise Fair and Community-preserving Approach to k-Center Clustering. In Proceedings of the International Conference on Machine Learning. 1178\u20131189."},{"key":"e_1_3_2_1_12_1","unstructured":"Deeparnab Chakrabarty and Maryam Negahbani. 2021. Better Algorithms for Individually Fair k-Clustering. arXiv preprint arXiv:2106.12150(2021)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on Machine Learning. PMLR, 1032\u20131041","author":"Chen Xingyu","year":"2019","unstructured":"Xingyu Chen, Brandon Fain, Liang Lyu, and Kamesh Munagala. 2019. Proportionally fair clustering. In International Conference on Machine Learning. PMLR, 1032\u20131041."},{"key":"e_1_3_2_1_15_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In Advances in Neural Information Processing Systems. 5036\u20135044."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.104"},{"key":"e_1_3_2_1_17_1","volume-title":"Fair prediction with disparate impact: A study of bias in recidivism prediction instruments. Big data 5, 2","author":"Chouldechova Alexandra","year":"2017","unstructured":"Alexandra Chouldechova. 2017. Fair prediction with disparate impact: A study of bias in recidivism prediction instruments. Big data 5, 2 (2017), 153\u2013163."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376898"},{"key":"e_1_3_2_1_19_1","volume-title":"Probabilistic fair clustering. Advances in Neural Information Processing Systems 33","author":"Esmaeili Seyed","year":"2020","unstructured":"Seyed Esmaeili, Brian Brubach, Leonidas Tsepenekas, and John Dickerson. 2020. Probabilistic fair clustering. Advances in Neural Information Processing Systems 33 (2020)."},{"key":"e_1_3_2_1_20_1","volume-title":"Fair Clustering Under a Bounded Cost. Advances in Neural Information Processing Systems","author":"Esmaeili A","year":"2021","unstructured":"Seyed\u00a0A Esmaeili, Brian Brubach, Aravind Srinivasan, and John\u00a0P Dickerson. 2021. Fair Clustering Under a Bounded Cost. Advances in Neural Information Processing Systems (2021)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445906"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems.","author":"Huang Lingxiao","year":"2019","unstructured":"Lingxiao Huang, Shaofeng Jiang, and Nisheeth Vishnoi. 2019. Coresets for Clustering with Fairness Constraints. In Proceedings of the Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the International Conference on Machine Learning. 4940\u20134949","author":"Jones Matthew","year":"2020","unstructured":"Matthew Jones, Huy Nguyen, and Thy Nguyen. 2020. Fair k-centers via maximum matching. In Proceedings of the International Conference on Machine Learning. 4940\u20134949."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Symposium on Foundations of Responsible Computing. 5:1\u20135:15","author":"Jung Christopher","year":"2020","unstructured":"Christopher Jung, Sampath Kannan, and Neil Lutz. 2020. A Center in Your Neighborhood: Fairness in Facility Location. In Proceedings of the Symposium on Foundations of Responsible Computing. 5:1\u20135:15."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"volume-title":"The ethical algorithm: The science of socially aware algorithm design","author":"Kearns Michael","key":"e_1_3_2_1_28_1","unstructured":"Michael Kearns and Aaron Roth. 2019. The ethical algorithm: The science of socially aware algorithm design. Oxford University Press."},{"key":"e_1_3_2_1_29_1","volume-title":"Human decisions and machine predictions. The quarterly journal of economics 133, 1","author":"Kleinberg Jon","year":"2018","unstructured":"Jon Kleinberg, Himabindu Lakkaraju, Jure Leskovec, Jens Ludwig, and Sendhil Mullainathan. 2018. Human decisions and machine predictions. The quarterly journal of economics 133, 1 (2018), 237\u2013293."},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the Innovations in Theoretical Computer Science.","author":"Kleinberg Jon","year":"2017","unstructured":"Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2017. Inherent Trade-Offs in the Fair Determination of Risk Scores. In Proceedings of the Innovations in Theoretical Computer Science."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the International Conference on Machine Learning. 3448\u20133457","author":"Kleindessner Matth\u00e4us","year":"2019","unstructured":"Matth\u00e4us Kleindessner, Pranjal Awasthi, and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In Proceedings of the International Conference on Machine Learning. 3448\u20133457."},{"key":"e_1_3_2_1_32_1","unstructured":"Matth\u00e4us Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2020. A Notion of Individual Fairness for Clustering. arXiv preprint arXiv:2006.04960(2020)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/130938645"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the International Conference on Machine Learning. 6586\u20136596","author":"Mahabadi Sepideh","year":"2020","unstructured":"Sepideh Mahabadi and Ali Vakilian. 2020. Individual fairness for k-clustering. In Proceedings of the International Conference on Machine Learning. 6586\u20136596."},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the Conference on Learning Theory. PMLR, 3246\u20133264","author":"Makarychev Yury","year":"2021","unstructured":"Yury Makarychev and Ali Vakilian. 2021. Approximation Algorithms for Socially Fair Clustering. In Proceedings of the Conference on Learning Theory. PMLR, 3246\u20133264."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372867"},{"key":"e_1_3_2_1_37_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Micha Evi","year":"2020","unstructured":"Evi Micha and Nisarg Shah. 2020. Proportionally Fair Clustering Revisited. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Privacy Preserving Clustering with Constraints","volume":"96","author":"R\u00f6sner Clemens","year":"2018","unstructured":"Clemens R\u00f6sner and Melanie Schmidt. 2018. Privacy Preserving Clustering with Constraints. In Proceedings of the International Colloquium on Automata, Languages, and Programming. 96:1\u201396:14.","journal-title":"Proceedings of the International Colloquium on Automata, Languages, and Programming."},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the International Workshop on Approximation and Online Algorithms. 232\u2013251","author":"Schmidt Melanie","year":"2019","unstructured":"Melanie Schmidt, Chris Schwiegelshohn, and Christian Sohler. 2019. Fair Coresets and Streaming Algorithms for Fair k-means. In Proceedings of the International Workshop on Approximation and Online Algorithms. 232\u2013251."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00021-1"},{"key":"e_1_3_2_1_41_1","unstructured":"Ali Vakilian and Mustafa Yal\u00e7\u0131ner. 2021. Improved approximation algorithms for individually fair clustering. arXiv preprint arXiv:2106.14043(2021)."}],"event":{"name":"FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency","sponsor":["ACM Association for Computing Machinery"],"location":"Seoul Republic of Korea","acronym":"FAccT '22"},"container-title":["2022 ACM Conference on Fairness Accountability and Transparency"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531146.3533146","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531146.3533146","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531146.3533146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:08Z","timestamp":1750186928000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531146.3533146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":41,"alternative-id":["10.1145\/3531146.3533146","10.1145\/3531146"],"URL":"https:\/\/doi.org\/10.1145\/3531146.3533146","relation":{},"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"2022-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}