- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Spanning and Spacing: Commentary on ‘New Possibilities for Fair Algorithms’
Philosophy and Technology 37 (4):1-3 (2024)
Abstract
Nielsen and Stewart (2024) introduced a novel intra-group criterion of algorithmic fairness called ‘spanning’. Here, I propose an alternative intra-group criterion and argue that is has some salient advantages over spanning.Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Spanning in and Spacing out? A Reply to Eva.Michael Nielsen & Rush Stewart - 2024 - Philosophy and Technology 37 (4):1-4.
New Possibilities for Fair Algorithms.Michael Nielsen & Rush Stewart - 2024 - Philosophy and Technology 37 (4):1-17.
Escaping the Impossibility of Fairness: From Formal to Substantive Algorithmic Fairness.Ben Green - 2022 - Philosophy and Technology 35 (4):1-32.
Updating Probability: Tracking Statistics as Criterion.Bas C. van Fraassen & Joseph Y. Halpern - 2017 - British Journal for the Philosophy of Science 68 (3):725-743.
Updating Probability: Tracking Statistics as Criterion.Bas C. van Fraassen & Joseph Y. Halpern - 2016 - British Journal for the Philosophy of Science:axv027.
Finding socially best spanning trees.Andreas Darmann, Christian Klamler & Ulrich Pferschy - 2011 - Theory and Decision 70 (4):511-527.
Fairness and Risk: An Ethical Argument for a Group Fairness Definition Insurers Can Use.Joachim Baumann & Michele Loi - 2023 - Philosophy and Technology 36 (3):1-31.
Emergent Discrimination: Should We Protect Algorithmic Groups?Jannik Zeiser - forthcoming - Journal of Applied Philosophy.
Analytics
Added to PP
2024-11-28
Downloads
11 (#1,459,590)
6 months
11 (#246,005)
2024-11-28
Downloads
11 (#1,459,590)
6 months
11 (#246,005)
Historical graph of downloads
Author's Profile
References found in this work
New Possibilities for Fair Algorithms.Michael Nielsen & Rush Stewart - 2024 - Philosophy and Technology 37 (4):1-17.
An Impossibility Theorem for Base Rate Tracking and Equalized Odds.Rush Stewart, Benjamin Eva, Shanna Slank & Reuben Stern - 2024 - Analysis 84 (4):778-787.
Algorithmic Fairness and Base Rate Tracking.Benjamin Eva - 2022 - Philosophy and Public Affairs 50 (2):239-266.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8567d8d854-wzn75 dc2