Cookies Policy
X

This site uses cookies. By continuing to browse the site you are agreeing to our use of cookies.

I accept this policy

Find out more here

The Mixed Solution to the Number Problem

No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
The full text of this article is not currently available.

Brill’s MyBook program is exclusively available on BrillOnline Books and Journals. Students and scholars affiliated with an institution that has purchased a Brill E-Book on the BrillOnline platform automatically have access to the MyBook option for the title(s) acquired by the Library. Brill MyBook is a print-on-demand paperback copy which is sold at a favorably uniform low price.

Access this article

+ Tax (if applicable)
Add to Favorites

image of Journal of Moral Philosophy

You must either save a group of m people or a group of n people. If there are no morally relevant differences among the people, which group should you save? This problem is known as the number problem. The 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. This 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.

10.1163/174552409X402331
/content/journals/10.1163/174552409x402331
dcterms_title,pub_keyword,dcterms_description,pub_author
6
3
Loading
Loading

Full text loading...

/content/journals/10.1163/174552409x402331
Loading

Data & Media loading...

http://brill.metastore.ingenta.com/content/journals/10.1163/174552409x402331
Loading

Article metrics loading...

/content/journals/10.1163/174552409x402331
2009-03-01
2016-08-27

Sign-in

Can't access your account?
  • Key

  • Full access
  • Open Access
  • Partial/No accessInformation