The Mixed Solution to the Number Problem

Journal of Moral Philosophy 6 (2):166-177 (2009)
Abstract
You must either save a group of m people or a group of n people. If there are no morally relevant diff erences among the people, which group should you save? is problem is known as the number problem. e recent discussion has focussed on three proposals: (i) Save the greatest number of people, (ii) Toss a fair coin, or (iii) Set up a weighted lottery, in which the probability of saving m people is m / m + n , and the probability of saving n people is n / m + n . is contribution examines a fourth alternative, the mixed solution, according to which both fairness and the total number of people saved count. It is shown that the mixed solution can be defended without assuming the possibility of interpersonal comparisons of value.
Keywords AGGREGATION   CONSEQUENTIALISM   FAIRNESS   NUMBER PROBLEM
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,371
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Similar books and articles
Analytics

Monthly downloads

Added to index

2010-05-08

Total downloads

30 ( #59,278 of 1,102,858 )

Recent downloads (6 months)

9 ( #24,605 of 1,102,858 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.