Category:Decision-making paradoxes
 | Computing portal |
Here is a list of articles in the Decision-making paradoxes category of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has only the following subcategory.
P
Pages in category "Decision-making paradoxes"
The following 33 pages are in this category, out of 33 total.
A
- Abilene paradox (computing)
- Allais paradox (computing)
- Apportionment paradox (computing)
- Arrow's impossibility theorem (computing)
B
- Buridan's ass (computing)
C
- Chainstore paradox (computing)
- Condorcet paradox (computing)
D
- Decision-making paradox (computing)
- Disposition effect (computing)
E
- Ellsberg paradox (computing)
- Exchange paradox (computing)
F
- Fenno's paradox (computing)
- Fredkin's paradox (computing)
G
- Green paradox (computing)
H
- Hard–easy effect (computing)
I
- Inventor's paradox (computing)
K
- Kavka's toxin puzzle (computing)
M
- Mandarin paradox (computing)
- Monty Hall problem (computing)
- Morton's fork (philosophy)
N
- Navigation paradox (computing)
- Necktie paradox (computing)
- Newcomb's paradox (computing)
P
- Paradox of tolerance (computing)
- Paradox of voting (computing)
- Parrondo's paradox (computing)
- Pascal's mugging (computing)
- Prevention paradox (computing)
S
- Siegel's paradox (computing)
- St. Petersburg paradox (computing)
T
- Three Prisoners problem (computing)
- Two envelopes problem (computing)
W
- Willpower paradox (computing)
Mathematics
Organizations
Books
About