{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/strategic-classification","title":"Strategic Classification","arxiv_id":"1506.06980","date":"2015-06-23","proceeding":null,"authors":["Moritz Hardt","Nimrod Megiddo","Christos Papadimitriou","Mary Wootters"],"abstract":"Machine learning relies on the assumption that unseen test instances of a\nclassification problem follow the same distribution as observed training data.\nHowever, this principle can break down when machine learning is used to make\nimportant decisions about the welfare (employment, education, health) of\nstrategic individuals. Knowing information about the classifier, such\nindividuals may manipulate their attributes in order to obtain a better\nclassification outcome. As a result of this behavior---often referred to as\ngaming---the performance of the classifier may deteriorate sharply. Indeed,\ngaming is a well-known obstacle for using machine learning methods in practice;\nin financial policy-making, the problem is widely known as Goodhart's law. In\nthis paper, we formalize the problem, and pursue algorithms for learning\nclassifiers that are robust to gaming.\n  We model classification as a sequential game between a player named \"Jury\"\nand a player named \"Contestant.\" Jury designs a classifier, and Contestant\nreceives an input to the classifier, which he may change at some cost. Jury's\ngoal is to achieve high classification accuracy with respect to Contestant's\noriginal input and some underlying target classification function. Contestant's\ngoal is to achieve a favorable classification outcome while taking into account\nthe cost of achieving it.\n  For a natural class of cost functions, we obtain computationally efficient\nlearning algorithms which are near-optimal. Surprisingly, our algorithms are\nefficient even on concept classes that are computationally hard to learn. For\ngeneral cost functions, designing an approximately optimal strategy-proof\nclassifier, for inverse-polynomial approximation, is NP-hard.","url_abs":"http://arxiv.org/abs/1506.06980v2","url_pdf":"http://arxiv.org/pdf/1506.06980v2.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":"strategic-classification","repo_url":"https://github.com/mrtzh/whynot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"strategic-classification","repo_url":"https://github.com/zykls/whynot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1506.06980","atlas_url":"https://app.syntology.ai/?focus=1506.06980","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1506.06980"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1506.06980\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1506.06980"},"call":"get_concepts_for_paper(arxiv_id=\"1506.06980\")"}],"by_repo":[{"repo":"mrtzh/whynot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2002.06673"],"harvested_for_calls":[{"arxiv_id":"2002.06673","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.06673"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.06673\")"}]},{"repo":"zykls/whynot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ad9d34cf1bdf5c999519e935d03adbbc7ed8c6613709c23fb9eb9f545690b63b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}