Incompleteness, Independence, and Negative Dominance

Abstract

This paper introduces the axiom of Negative Dominance, stating that if a lottery f is strictly preferred to a lottery g, then some outcome in the support of f is strictly preferred to some outcome in the support of g. It is shown that if preferences are incomplete on a sufficiently rich domain, then this plausible axiom, which holds for complete preferences, is incompatible with an array of otherwise plausible axioms for choice under uncertainty. In particular, in this setting, Negative Dominance conflicts with the standard Independence axiom. A novel theory, which includes Negative Dominance, and rejects Independence, is developed and shown to be consistent.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Lexicographic expected utility without completeness.D. Borie - 2016 - Theory and Decision 81 (2):167-176.
Fixing Stochastic Dominance.Jeffrey Sanford Russell - forthcoming - The British Journal for the Philosophy of Science.
Opaque Sweetening and Transitivity.Ryan Doody - 2019 - Australasian Journal of Philosophy 97 (3):559-571.
The Logic of Dominance Reasoning.John Cantwell - 2006 - Journal of Philosophical Logic 35 (1):41-63.
Decision theory for agents with incomplete preferences.Adam Bales, Daniel Cohen & Toby Handfield - 2014 - Australasian Journal of Philosophy 92 (3):453-70.
Independence of irrelevant alternatives revisited.Susumu Cato - 2014 - Theory and Decision 76 (4):511-527.
Infinite Prospects.Jeffrey Sanford Russell & Yoaav Isaacs - 2021 - Philosophy and Phenomenological Research 103 (1):178-198.
Hard Choices Made Harder.Ryan Doody - 2021 - In Henrik Andersson & Anders Herlitz (eds.), Value Incommensurability: Ethics, Risk. And Decision-Making. New York, NY: Routledge. pp. 247-266.
A Mathematical Commitment Without Computational Strength.Anton Freund - 2022 - Review of Symbolic Logic 15 (4):880-906.

Analytics

Added to PP
2023-11-27

Downloads
444 (#44,093)

6 months
444 (#3,817)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Harvey Lederman
University of Texas at Austin

Citations of this work

No citations found.

Add more citations

References found in this work

Stochastic Dominance and Opaque Sweetening.Ralf M. Bader - 2018 - Australasian Journal of Philosophy 96 (3):498-507.

Add more references