{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-new-notion-of-individually-fair-clustering","title":"A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center","arxiv_id":"2106.05423","date":"2021-06-09","proceeding":null,"authors":["Darshan Chakrabarti","John P. Dickerson","Seyed A. Esmaeili","Aravind Srinivasan","Leonidas Tsepenekas"],"abstract":"Clustering is a fundamental problem in unsupervised machine learning, and fair variants of it have recently received significant attention due to its societal implications. In this work we introduce a novel definition of individual fairness for clustering problems. Specifically, in our model, each point $j$ has a set of other points $\\mathcal{S}_j$ that it perceives as similar to itself, and it feels that it is fairly treated if the quality of service it receives in the solution is $\\alpha$-close (in a multiplicative sense, for a given $\\alpha \\geq 1$) to that of the points in $\\mathcal{S}_j$. We begin our study by answering questions regarding the structure of the problem, namely for what values of $\\alpha$ the problem is well-defined, and what the behavior of the \\emph{Price of Fairness (PoF)} for it is. For the well-defined region of $\\alpha$, we provide efficient and easily-implementable approximation algorithms for the $k$-center objective, which in certain cases enjoy bounded-PoF guarantees. We finally complement our analysis by an extensive suite of experiments that validates the effectiveness of our theoretical results.","url_abs":"https://arxiv.org/abs/2106.05423v3","url_pdf":"https://arxiv.org/pdf/2106.05423v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-new-notion-of-individually-fair-clustering","repo_url":"https://github.com/chakrabarti/equitable_clustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"fairness","task_name":"Fairness"}],"methods":[{"method_slug":null,"method_name":null}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2106.05423","atlas_url":"https://app.syntology.ai/?focus=2106.05423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05423"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/chakrabarti/equitable_clustering","reach":null}],"summary":{"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":1,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"samples":[{"code_sha256_prefix":"5e29a09eaaa95531","entry":"nonisolated_and_isolated","repo":"chakrabarti/equitable_clustering","repo_kind":"official","path":"equitable_clustering.py","file_url":"https://github.com/chakrabarti/equitable_clustering/blob/HEAD/equitable_clustering.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5e29a09eaaa95531"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}