{"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":"/task/fairness/papers/57","list_of":"/task/fairness","task":"Fairness","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":57,"pages_in_order":57,"rows_per_page":100,"rows":[5601,5676],"of":5676,"counts":{"archive_papers_tagged":5676,"with_a_code_link":1714,"where_syntology_ran_a_sample":404,"not_listed_spam_title":0,"listed":5676,"listed_where_code_ran":404,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":329,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":329,"listed_every_run_a_failure_of_syntologys_instrument":75,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/fairness","prev":"/task/fairness/papers/56","next":null,"papers":[{"url":null,"slug":"a-continuous-framework-for-fairness","title":"Matching Code and Law: Achieving Algorithmic Fairness with Optimal Transport","date":"2017-12-21","arxiv_id":"1712.07924","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-forests-regularized-tree-induction-to","title":"Fair Forests: Regularized Tree Induction to Minimize Model Bias","date":"2017-12-21","arxiv_id":"1712.08197","repositories_listed":0,"syntology":null},{"url":null,"slug":"interventions-over-predictions-reframing-the","title":"Interventions over Predictions: Reframing the Ethical Debate for Actuarial Risk Assessment","date":"2017-12-21","arxiv_id":"1712.08238","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-structure-of-income-inequality","title":"Exponential Structure of Income Inequality: Evidence from 67 Countries","date":"2017-12-16","arxiv_id":"1612.01624","repositories_listed":0,"syntology":null},{"url":null,"slug":"recycling-privileged-learning-and","title":"Recycling Privileged Learning and Distribution Matching for Fairness","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"when-worlds-collide-integrating-different","title":"When Worlds Collide: Integrating Different Counterfactual Assumptions in Fairness","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-face-fairness-framework-for-3d-meshes","title":"A Face Fairness Framework for 3D Meshes","date":"2017-11-22","arxiv_id":"1711.08155","repositories_listed":0,"syntology":null},{"url":null,"slug":"groupwise-maximin-fair-allocation-of","title":"Groupwise Maximin Fair Allocation of Indivisible Goods","date":"2017-11-21","arxiv_id":"1711.07621","repositories_listed":0,"syntology":null},{"url":null,"slug":"deletion-robust-submodular-maximization-at","title":"Deletion-Robust Submodular Maximization at Scale","date":"2017-11-20","arxiv_id":"1711.07112","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-epistemological-principles-for-bias","title":"Modeling Epistemological Principles for Bias Mitigation in AI Systems: An Illustration in Hiring Decisions","date":"2017-11-20","arxiv_id":"1711.07111","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-kernel-learning","title":"Fair Kernel Learning","date":"2017-10-16","arxiv_id":"1710.05578","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-algorithms-for-computing-fair","title":"Spectral Algorithms for Computing Fair Support Vector Machines","date":"2017-10-16","arxiv_id":"1710.05895","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-algorithm-for-fairness-aware","title":"Two-stage Algorithm for Fairness-aware Machine Learning","date":"2017-10-13","arxiv_id":"1710.04924","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-formalizing-fairness-in-prediction-with","title":"On Formalizing Fairness in Prediction with Machine Learning","date":"2017-10-09","arxiv_id":"1710.03184","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-opening-up-the-black-box-investigating","title":"Beyond opening up the black box: Investigating the role of algorithmic systems in Wikipedian organizational culture","date":"2017-09-26","arxiv_id":"1709.09093","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-testing-testing-software-for","title":"Fairness Testing: Testing Software for Discrimination","date":"2017-09-11","arxiv_id":"1709.03221","repositories_listed":0,"syntology":null},{"url":null,"slug":"easeml-towards-multi-tenant-resource-sharing","title":"Ease.ml: Towards Multi-tenant Resource Sharing for Machine Learning Workloads","date":"2017-08-24","arxiv_id":"1708.07308","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-machine-learning-a-perspective","title":"Fairness-aware machine learning: a perspective","date":"2017-08-02","arxiv_id":"1708.00754","repositories_listed":0,"syntology":null},{"url":null,"slug":"meritocratic-fairness-for-cross-population","title":"Meritocratic Fairness for Cross-Population Selection","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"decoupled-classifiers-for-fair-and-efficient","title":"Decoupled classifiers for fair and efficient machine learning","date":"2017-07-20","arxiv_id":"1707.06613","repositories_listed":0,"syntology":null},{"url":null,"slug":"subdeterminant-maximization-via-nonconvex","title":"Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration","date":"2017-07-10","arxiv_id":"1707.02757","repositories_listed":0,"syntology":null},{"url":null,"slug":"networked-fairness-in-cake-cutting","title":"Networked Fairness in Cake Cutting","date":"2017-07-07","arxiv_id":"1707.02033","repositories_listed":0,"syntology":null},{"url":null,"slug":"calibrated-fairness-in-bandits","title":"Calibrated Fairness in Bandits","date":"2017-07-06","arxiv_id":"1707.01875","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impossibility-of-fairness-a-generalized","title":"The impossibility of \"fairness\": a generalized impossibility result for decisions","date":"2017-07-05","arxiv_id":"1707.01195","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminatory-transfer","title":"Discriminatory Transfer","date":"2017-07-03","arxiv_id":"1707.00780","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-pipelines","title":"Fair Pipelines","date":"2017-07-03","arxiv_id":"1707.00391","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-decisions-and-theoretical-implications","title":"Data Decisions and Theoretical Implications when Adversarially Learning Fair Representations","date":"2017-07-01","arxiv_id":"1707.00075","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairer-and-more-accurate-but-for-whom","title":"Fairer and more accurate, but for whom?","date":"2017-06-30","arxiv_id":"1707.00046","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-fairness-diversity-and-randomness-in","title":"On Fairness, Diversity and Randomness in Algorithmic Decision Making","date":"2017-06-30","arxiv_id":"1706.10208","repositories_listed":0,"syntology":null},{"url":null,"slug":"racial-disparity-in-natural-language","title":"Racial Disparity in Natural Language Processing: A Case Study of Social Media African-American English","date":"2017-06-30","arxiv_id":"1707.00061","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-fairness-metrics-for-recommendation-that","title":"New Fairness Metrics for Recommendation that Embrace Differences","date":"2017-06-29","arxiv_id":"1706.09838","repositories_listed":0,"syntology":null},{"url":null,"slug":"logics-and-practices-of-transparency-and","title":"Logics and practices of transparency and opacity in real-world applications of public sector machine learning","date":"2017-06-19","arxiv_id":"1706.09249","repositories_listed":0,"syntology":null},{"url":null,"slug":"avoiding-discrimination-through-causal","title":"Avoiding Discrimination through Causal Reasoning","date":"2017-06-08","arxiv_id":"1706.02744","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-fairness","title":"Bayesian fairness","date":"2017-05-31","arxiv_id":"1706.00119","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-inference-on-outcomes","title":"Fair Inference On Outcomes","date":"2017-05-29","arxiv_id":"1705.10378","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cost-of-fairness-in-classification","title":"The cost of fairness in classification","date":"2017-05-25","arxiv_id":"1705.09055","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-succeed-while-teaching-to-fail","title":"Learning to Succeed while Teaching to Fail: Privacy in Closed Machine Learning Systems","date":"2017-05-23","arxiv_id":"1705.08197","repositories_listed":0,"syntology":null},{"url":null,"slug":"people-on-media-jointly-identifying-credible","title":"People on Media: Jointly Identifying Credible News and Trustworthy Citizen Journalists in Online Communities","date":"2017-05-07","arxiv_id":"1705.02667","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-better-open-source-tools-to-support","title":"Building Better Open-Source Tools to Support Fairness in Automated Scoring","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"these-are-not-the-stereotypes-you-are-looking","title":"These are not the Stereotypes You are Looking For: Bias and Fairness in Authorial Gender Attribution","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fairjudge-trustworthy-user-prediction-in","title":"FairJudge: Trustworthy User Prediction in Rating Platforms","date":"2017-03-30","arxiv_id":"1703.10545","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-criminal-justice-risk-assessments","title":"Fairness in Criminal Justice Risk Assessments: The State of the Art","date":"2017-03-27","arxiv_id":"1703.09207","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-prediction-with-disparate-impact-a-study-1","title":"Fair prediction with disparate impact: A study of bias in recidivism prediction instruments","date":"2017-02-28","arxiv_id":"1703.00056","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-lexicographic-fairness-and-a","title":"Balancing Lexicographic Fairness and a Utilitarian Objective with Application to Kidney Exchange","date":"2017-02-27","arxiv_id":"1702.08286","repositories_listed":0,"syntology":null},{"url":null,"slug":"eomm-an-engagement-optimized-matchmaking","title":"EOMM: An Engagement Optimized Matchmaking Framework","date":"2017-02-22","arxiv_id":"1702.06820","repositories_listed":0,"syntology":null},{"url":null,"slug":"proactive-resource-management-for-lte-in","title":"Proactive Resource Management for LTE in Unlicensed Spectrum: A Deep Learning Perspective","date":"2017-02-22","arxiv_id":"1702.07031","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-program-bias","title":"Quantifying Program Bias","date":"2017-02-17","arxiv_id":"1702.05437","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-reinforcement-learning","title":"Fairness in Reinforcement Learning","date":"2016-11-09","arxiv_id":"1611.03071","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-algorithms-for-infinite-and-contextual","title":"Fair Algorithms for Infinite and Contextual Bandits","date":"2016-10-29","arxiv_id":"1610.09559","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-prediction-with-disparate-impact-a-study","title":"Fair prediction with disparate impact: A study of bias in recidivism prediction instruments","date":"2016-10-24","arxiv_id":"1610.07524","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-be-fair-and-diverse","title":"How to be Fair and Diverse?","date":"2016-10-23","arxiv_id":"1610.07183","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-as-a-program-property","title":"Fairness as a Program Property","date":"2016-10-19","arxiv_id":"1610.06067","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-multiplicity-of-memory-enhancement","title":"The multiplicity of memory enhancement: Practical and ethical implications of the diverse neural substrates underlying human memory systems","date":"2016-09-26","arxiv_id":"1609.08083","repositories_listed":0,"syntology":null},{"url":null,"slug":"inherent-trade-offs-in-the-fair-determination","title":"Inherent Trade-Offs in the Fair Determination of Risk Scores","date":"2016-09-19","arxiv_id":"1609.05807","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-constrained","title":"On the Complexity of Constrained Determinantal Point Processes","date":"2016-08-01","arxiv_id":"1608.00554","repositories_listed":0,"syntology":null},{"url":null,"slug":"satisfying-real-world-goals-with-dataset","title":"Satisfying Real-world Goals with Dataset Constraints","date":"2016-06-24","arxiv_id":"1606.07558","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-crossover-process-learnability-and-data","title":"The Crossover Process: Learnability and Data Protection from Inference Attacks","date":"2016-06-13","arxiv_id":"1606.04160","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-learning-classic-and-contextual","title":"Fairness in Learning: Classic and Contextual Bandits","date":"2016-05-23","arxiv_id":"1605.07139","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlated-equilibria-for-approximate","title":"Correlated Equilibria for Approximate Variational Inference in MRFs","date":"2016-04-10","arxiv_id":"1604.02737","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiency-and-sequenceability-in-fair","title":"Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences","date":"2016-04-06","arxiv_id":"1604.01734","repositories_listed":0,"syntology":null},{"url":null,"slug":"demonstrating-the-feasibility-of-automatic","title":"Demonstrating the Feasibility of Automatic Game Balancing","date":"2016-03-11","arxiv_id":"1603.03795","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-matchmaking-to-improve-accuracy-of","title":"Automated Matchmaking to Improve Accuracy of Applicant Selection for University Education System","date":"2015-07-09","arxiv_id":"1507.02439","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-learning-with-restriction-of","title":"Fairness-Aware Learning with Restriction of Universal Dependency using f-Divergences","date":"2015-06-25","arxiv_id":"1506.07721","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-task-allocation-in-transportation","title":"Fair task allocation in transportation","date":"2015-05-27","arxiv_id":"1505.07434","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-laws-of-human-society-s-income","title":"Universal Laws of Human Society's Income Distribution","date":"2015-05-22","arxiv_id":"1506.05418","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-relation-between-accuracy-and-fairness","title":"On the relation between accuracy and fairness in binary classification","date":"2015-05-21","arxiv_id":"1505.05723","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-mobility-management-in-hetnets","title":"Context-Aware Mobility Management in HetNets: A Reinforcement Learning Approach","date":"2015-05-07","arxiv_id":"1505.01625","repositories_listed":0,"syntology":null},{"url":null,"slug":"ell_p-testing-and-learning-of-discrete","title":"$\\ell_p$ Testing and Learning of Discrete Distributions","date":"2014-12-07","arxiv_id":"1412.2314","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-multi-agent-sequential-decision","title":"Fairness in Multi-Agent Sequential Decision-Making","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-dynamic-traffic-signal","title":"Context Aware Dynamic Traffic Signal Optimization","date":"2014-07-19","arxiv_id":"1407.5212","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-transliteration-met-crowdsourcing-an","title":"When Transliteration Met Crowdsourcing : An Empirical Study of Transliteration via Crowdsourcing using Efficient, Non-redundant and Fair Quality Control","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compact-argumentation-frameworks","title":"Compact Argumentation Frameworks","date":"2014-04-30","arxiv_id":"1404.7734","repositories_listed":0,"syntology":null},{"url":null,"slug":"extension-of-sparse-randomized-kaczmarz","title":"Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors","date":"2014-01-10","arxiv_id":"1401.2288","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-assignment-of-indivisible-objects-under","title":"Fair assignment of indivisible objects under ordinal preferences","date":"2013-12-23","arxiv_id":"1312.6546","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-decomposition-of-the-max-min-fair","title":"A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem","date":"2013-06-24","arxiv_id":"1306.5601","repositories_listed":0,"syntology":null},{"url":null,"slug":"-discounting-multi-criteria-decision-making-d","title":"$α$-Discounting Multi-Criteria Decision Making ($α$-D MCDM)","date":"2010-01-31","arxiv_id":"1002.0102","repositories_listed":0,"syntology":null}],"record_sha256":"f94d952288926366e0059d21a2173e9aadf003c5c06e4859b9c3266ffcdecfaf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}