| 000 | 05494nam a2200637 i 4500 | ||
|---|---|---|---|
| 001 | 9798400708626 | ||
| 003 | ACM | ||
| 005 | 20260528133339.0 | ||
| 008 | 050923s2023 nyu 001 0deng d | ||
| 020 | _a3603195 | ||
| 020 |
_a9798400708626 _qebook |
||
| 020 |
_a9798400708602 _qepub |
||
| 020 |
_z9798400708619 _qhardcover |
||
| 020 |
_z9798400708596 _qpaperback |
||
| 024 | 7 |
_a10.1145/3603195 _2doi |
|
| 100 | 0 |
_aRaghavan, Manish _eauthor. |
|
| 245 | 1 | 0 |
_aThe Societal Impacts of Algorithmic Decision-Making/ _cManish Raghavan. |
| 250 | _aFirst Edition | ||
| 264 | 1 |
_a[New York, NY, USA] : _bAssociation for Computing Machinery; _c[2023]. |
|
| 300 |
_a1 PDF (xxiv, 340pages) _bLuaTEX |
||
| 490 | 1 |
_aACM books, _x2374-6777 ; _v#53 |
|
| 505 | 8 | _a Introduction -- Overview of the Book | |
| 505 | 8 | _a PART I THEORETICAL FOUNDATIONS FOR FAIRNESS IN ALGORITHMIC DECISION-MAKING -- Overview of Part I | |
| 505 | 8 | _a1 Inherent Tradeoffs in the Fair Determination of Risk Scores -- 1.1 A Formal Model of Risk Assessment -- 1.2 The Characterization Theorems -- 1.3 The Approximate Theorem -- 1.4 Reducing Loss with Equal Base Rates -- 1.5 Conclusion | |
| 505 | 8 | _a2 On Fairness and Calibration -- 2.1 Problem Setup -- 2.2 Relaxing Equalized Odds to Preserve Calibration -- 2.3 Experiments -- 2.4 Discussion and Conclusion | |
| 505 | 8 | _a3 The Externalities of Exploration and How Data Diversity Helps Exploitation -- 3.1 Preliminaries --3.2 Group Externality of Exploration -- 3.3 Greedy Algorithms and LinUCB with Perturbed Contexts -- 3.4 Analysis: LinUCB with Perturbed Contexts -- 3.5 Analysis: Greedy Algorithms with Perturbed Contexts | |
| 505 | 8 | _a PART II MODELS OF BEHAVIOR -- Overview of Part II | |
| 505 | 8 | _a4 Selection Problems in the Presence of Implicit Bias -- 4.1 Overview and Summary of Results -- 4.2 Biased Selection with Power Law Distributions -- 4.3 Biased Selection with Bounded Distributions -- 4.4 Conclusion | |
| 505 | 8 | _a5 How Do Classifiers Induce Agents to Behave Strategically? -- 5.1 Model and Overview of Results -- 5.2 Incentivizing Particular Effort Profiles -- 5.3 Optimizing Other Objectives -- 5.4 The Structure of the Space of Linear Mechanisms -- 5.5 Conclusion | |
| 505 | 8 | _a6 Algorithmic Monoculture and Social Welfare -- 6.1 Algorithmic Hiring as a Case Study -- 6.2 Instantiating with Ranking Models -- 6.3 Models with Multiple Firms -- 6.4 Conclusion | |
| 505 | 8 | _a PART III APPLICATION DOMAINS -- Overview of Part III | |
| 505 | 8 | _a7 Mitigating Bias in Algorithmic Hiring: Evaluating Claims and Practices -- 7.1 Background -- 7.2 Empirical Findings -- 7.3 Analysis of Technical Concerns -- 7.4 Algorithmic De-biasing -- 7.5 Discussion and Recommendations | |
| 505 | 8 | _a8 The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasons -- 8.1 What Are Feature-highlighting Explanations? -- 8.2 Feature-highlighting Explanations in Practice -- 8.3 Unavoidable Tensions -- 8.4 Conclusion | |
| 505 | 8 | _a PART IV CONCLUSION AND FUTURE WORK | |
| 505 | 8 | _a9 Future Directions -- 9.1 Fairness in Machine Learning and Mechanism Design -- 9.2 Algorithmic Discrimination -- 9.3 Transparent and Meaningful Explanations | |
| 505 | 8 | _a PART V APPENDICES | |
| 505 | 8 | _a10 Appendix A Inherent Tradeoffs in the Fair Determination of Risk Scores -- A.1 NP-completeness of Non-trivial Integral Fair Risk Assignments | |
| 505 | 8 | _a11 Appendix B On Fairness and Calibration -- B.1 Linearity of Calibrated Classifiers -- B.2 Cost Functions -- B.3 Relationship Between Cost and Error -- B.4 Proof of Algorithm 2.1 Optimality and Approximate Optimality -- B.5 Proof of Impossibility and Approximate Impossibility -- B.6 Details on Experiments | |
| 505 | 8 | _a12 Appendix C The Externalities of Exploration and How Data Diversity Helps Exploitation -- C.1 (Sub)gaussians and Concentration -- C.2 KL-divergence -- C.3 Linear Algebra -- C.4 Logarithms | |
| 505 | 8 | _a13 Appendix D Selection Problems in the Presence of Implicit Bias -- D.1 Missing Proofs for Section 4.2 -- D.2 Additional Theorems for Power Laws --D.3 Lemmas for the Equivalence Definition -- D.4 Lemmas for Section D.2 -- D.5 Lemmas and Proofs for Section 4.3 | |
| 505 | 8 | _a14 Appendix E How Do Classifiers Induce Agents to Behave Strategically? -- E.1 Characterizing the Agent's Response to a Linear Mechanism | |
| 505 | 8 | _a15 Appendix F Algorithmic Monoculture and Social Welfare -- F.1 Random Utility Models Satisfying Definition 6.1 -- F.2 3-candidate RUM Counterexamples -- F.3 Proof of Theorem 6.2 -- F.4 Verifying that the Mallows Model Satisfies Definition 6.1 -- F.5 Proof of Theorem 6.3 -- F.6 Supplementary Lemmas for the Mallows Model | |
| 505 | 8 | _a16 Appendix G Mitigating Bias in Algorithmic Decision-making: Evaluating Claims and Practices -- G.1 Administrative Information on Vendors | |
| 505 | 8 | _aBibliography | |
| 505 | 8 | _aAuthors' Biographies | |
| 505 | 8 | _aIndex | |
| 506 | _aAbstract freely available; full-text restricted to subscribers or individual document purchasers. | ||
| 530 | _aAlso available in print. | ||
| 538 | _aMode of access: World Wide Web | ||
| 538 | _aSystem requirements: Adobe Acrobat Reader | ||
| 650 | 0 | _aThe Societal Impacts of Algorithmic Decision-Making (Computer Science) | |
| 655 | 0 | _aElectronic books. | |
| 776 | 0 | 8 |
_iPrint version: _z9798400708619 _z9798400708596 |
| 830 | 0 |
_aACM books - Collection 3 ; _v#53. |
|
| 856 | 4 | 0 |
_3Abstract with links to full text _uhttps://doi.org/10.1145/3603195 |
| 999 |
_c403 _d403 |
||