How Does Newcomb's Paradox Relate to the Prisoner's Dilemma?

  • Thread starter Thread starter thefuturism
  • Start date Start date
thefuturism
Messages
3
Reaction score
0
So, I'm studying for a philosophy midterm, and here's my sample question...

"Explain Lewis' reduction of the prisoner's dilemma to two Newcomb's problems. Is the reduction plausible as a solution to the prisoner's dilemma? Explain why it is or why it is not."

Okay, so I think I do understand this paradox.

The paradox is that conventional decision theory would predict that each player acts in the best possible way in response to the other player's choice (whatever that may be). Under this theory, one would choose both boxes in Newcomb's problem as to maximize their utility.

But, Newcomb's problem shows that the player will in fact choose only one box if she knows that she will receive a greater sum. (The predictor knows what the chooser will choose and the chooser knows of this... etc.)

What I don't understand and can't seem to find anywhere, is why or how Lewis reduces the Prisoner's Dilemma to two Newcomb problems.

Binmore does not believe the Newcomb problem to be a plausible solution to the prisoner's dilemma because it fails to take into account that the predictor must predict the chooser's choice even if the chooser were to choose irrationally.

I am still semi-confused about the whole matter.

Any help would be Greatly appreciated,
Thank you.
 
Physics news on Phys.org
Anybody?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top