Block: Probability matching vs. maximizing - Problem 1 [Wave 4]
Element Type: Block
Block Type: Standard
Block Name: Probability matching vs. maximizing - Problem 1
Questions In This Block:
Question QID198
Question Type: Matrix
Question Text:
Consider the following hypothetical situation: A deck with 10 cards is randomly shuffled 10 separate times. The 10 cards are composed of 7 cards with the number “1” on the down side and 3 cards with the number “2” on the down side. Each time the 10 cards are reshuffled, your task is to predict the number on the down side of the top card. Imagine that you will receive $100 for each downside number you correctly predict, and that you want to earn as much money as possible. What would you predict after …
Questions |
1 |
2 |
|---|---|---|
shuffle #1 |
☐ |
☐ |
shuffle #2 |
☐ |
☐ |
shuffle #3 |
☐ |
☐ |
shuffle #4 |
☐ |
☐ |
shuffle #5 |
☐ |
☐ |
shuffle #6 |
☐ |
☐ |
shuffle #7 |
☐ |
☐ |
shuffle #8 |
☐ |
☐ |
shuffle #9 |
☐ |
☐ |
shuffle #10 |
☐ |
☐ |