organsw
General Social Survey https://gss.norc.org
Question 626. Recently, medical science has made it possible to save lives by transplanting body parts from donors to patients who need them. But for some body organs there are not enough to go around, and some patients die before they can obtain a transplant. When only one organ is available and several patients need it for survival, the organ could be assigned to a patient by one of the following procedures: Auction: The organ is assigned to the patient who can pay the most for it. First come, first served: The organ is assigned to the patient who has been waiting the longest Lottery: The organ is assigned to the patient whose name is drawn at random. Merit: The organ is assigned to the patient who can make the greatest contribution to others and society. b. Which of these procedures would be the worst way to assign an organ?
For further details see the official GSS documentation.
Counts by year:
year | iap | auction | don't know | first come-first served | lottery | merit | no answer | Total |
1972 | 1613 | - | - | - | - | - | - | 1613 |
1973 | 1504 | - | - | - | - | - | - | 1504 |
1974 | 1484 | - | - | - | - | - | - | 1484 |
1975 | 1490 | - | - | - | - | - | - | 1490 |
1976 | 1499 | - | - | - | - | - | - | 1499 |
1977 | 1530 | - | - | - | - | - | - | 1530 |
1978 | 1532 | - | - | - | - | - | - | 1532 |
1980 | 1468 | - | - | - | - | - | - | 1468 |
1982 | 1860 | - | - | - | - | - | - | 1860 |
1983 | 1599 | - | - | - | - | - | - | 1599 |
1984 | 1473 | - | - | - | - | - | - | 1473 |
1985 | 1534 | - | - | - | - | - | - | 1534 |
1986 | 1470 | - | - | - | - | - | - | 1470 |
1987 | 1819 | - | - | - | - | - | - | 1819 |
1988 | 1481 | - | - | - | - | - | - | 1481 |
1989 | 1537 | - | - | - | - | - | - | 1537 |
1990 | 1372 | - | - | - | - | - | - | 1372 |
1991 | 1517 | - | - | - | - | - | - | 1517 |
1993 | 1606 | - | - | - | - | - | - | 1606 |
1994 | 2992 | - | - | - | - | - | - | 2992 |
1996 | 1460 | 1102 | 37 | 16 | 110 | 171 | 8 | 2904 |
1998 | 2832 | - | - | - | - | - | - | 2832 |
2000 | 2817 | - | - | - | - | - | - | 2817 |
2002 | 2765 | - | - | - | - | - | - | 2765 |
2004 | 2812 | - | - | - | - | - | - | 2812 |
2006 | 4510 | - | - | - | - | - | - | 4510 |
2008 | 2023 | - | - | - | - | - | - | 2023 |
2010 | 2044 | - | - | - | - | - | - | 2044 |
2012 | 1974 | - | - | - | - | - | - | 1974 |
2014 | 2538 | - | - | - | - | - | - | 2538 |
2016 | 2867 | - | - | - | - | - | - | 2867 |
2018 | 2348 | - | - | - | - | - | - | 2348 |
2021 | 4032 | - | - | - | - | - | - | 4032 |
2022 | 3544 | - | - | - | - | - | - | 3544 |
Total | 70946 | 1102 | 37 | 16 | 110 | 171 | 8 | 72390 |
1
auction
2
first come-first served
3
lottery
4
merit
NA(d)
don't know
NA(i)
iap
NA(j)
I don't have a job
NA(m)
dk, na, iap
NA(n)
no answer
NA(p)
not imputable
NA(q)
not imputable
NA(r)
refused
NA(s)
skipped on web
NA(u)
uncodeable
NA(x)
not available in this release
NA(y)
not available in this year
NA(z)
see codebook