What does Newcomb's paradox teach us?

03/06/2010
by   David H. Wolpert, et al.
0

In Newcomb's paradox you choose to receive either the contents of a particular closed box, or the contents of both that closed box and another one. Before you choose, a prediction algorithm deduces your choice, and fills the two boxes based on that deduction. Newcomb's paradox is that game theory appears to provide two conflicting recommendations for what choice you should make in this scenario. We analyze Newcomb's paradox using a recent extension of game theory in which the players set conditional probability distributions in a Bayes net. We show that the two game theory recommendations in Newcomb's scenario have different presumptions for what Bayes net relates your choice and the algorithm's prediction. We resolve the paradox by proving that these two Bayes nets are incompatible. We also show that the accuracy of the algorithm's prediction, the focus of much previous work, is irrelevant. In addition we show that Newcomb's scenario only provides a contradiction between game theory's expected utility and dominance principles if one is sloppy in specifying the underlying Bayes net. We also show that Newcomb's paradox is time-reversal invariant; both the paradox and its resolution are unchanged if the algorithm makes its `prediction' after you make your choice rather than before.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

07/14/2021

Asynchronous games on Petri nets and ATL

We define a game on distributed Petri nets, where several players intera...
10/21/2019

Relative Net Utility and the Saint Petersburg Paradox

The famous St Petersburg Paradox shows that the theory of expected value...
11/09/2019

Rule Designs for Optimal Online Game Matchmaking

Online games are the most popular form of entertainment among youngsters...
04/23/2020

The Category of Node-and-Choice Extensive-Form Games

This paper develops the category 𝐍𝐂𝐆. Its objects are node-and-choice ga...
06/02/2018

Optimal Clustering under Uncertainty

Classical clustering algorithms typically either lack an underlying prob...
07/05/2019

A comparison of various analytic choice principles

We investigate computability theoretic and descriptive set theoretic con...
01/10/2014

Dempster-Shafer Theory for Move Prediction in Start Kicking of The Bicycle Kick of Sepak Takraw Game

This paper presents Dempster-Shafer theory for move prediction in start ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.