1 Introduction
The Newcomb’s Paradox was exposed the first time in the paper written by Nozick in [1], a paper between the Game Theory [2] and philosophy. The paradox is essentially a game between two players and . The player plays first. he uses an oracle to know what will do. plays after , but he doesn’t know what has chosen. has two choices and . Symmetrically has two choices and . Because of the fact that is the first to play, ’s utility function is dependent from the choice of . The utilities are shown in table
Utility  

10000  0  
1010000  1000000 
Where the utilities are in euros. Now the problem is how can maximize his utility?
To solve the problem Nozick introduced two approaches, one based on dominant strategy and one based on the expected utility function. This approaches was used in combination to solve 6 different situations. Our aims are to create an alternative solution to the problems with the Expected Utility Function and analyze the graph of time lines to create an algorithm to test numerically the predictions.
2 State of the Art
This problem was inspired (as said by the same Nozick) by SciFi. The main issue of the problem is the presence of the oracle , which let predict the future. Then even if plays first, he knows what will do.
The first approach is based on Expected Utility Function. It observes that forecasts future (we will see that is more complicated than this). Then if choose the utility must be 1000. Otherwise the utility must be 1000000. For this reasoning the best choice for is .
The second approach is based on dominant strategy. It starts from the assumption that the oracle can fail. Then the choice gives an utility greater of 10000 than in every case. In other words it is a dominant strategy.
The fact that they are logically both valid, required a mathematical investigation to classify 6 different cases. In each cases he used one of the two approaches. For the classification see
[1]. We will reduce this classification to two distinct cases: The response of depends on the choice of or not.3 Classic approach
A classic approach to the problem is based on the probability. We start defining the utility table as
Utility  

where is a positive real for every couple of indexes. We also define the probabilities for .
Now we calculate the Expected Utility Function for the choice as
Observing that for every , we define and . So the previous equations become
and
will choose choice if and only if
which leads to the inequality in and
With the classical values , , and the inequality takes the form
which is solved graphically in Fig. 1.
Three important cases are when , which means that never fails, when , which means that has a random behavior, and finally when , when the ’s response is uncorrelated from the action of . As can be seen the classical two approach are modelized by the Expected Utility Function, in fact the green and the yellow dots represent different strategies.
4 Time Lines
The classical approach does not explain how the game works, but only analyzes the results of the game. The step that we want to do is to explain the dynamics of the game with sufficient detail to simulate it. But to do it we need a new way of thinking. We firstly introduce the notion of directed graph [3]. A graph is an object made up by a set of nodes and a set of edges . Every edges has a starting node and an arriving node, so an edge can be seen as an arrow from a node to an other node. Now the time lines graph (TLG) is a graph. This graph is constructed from the principle of temporal causality. Let’s make a simple example. The list

open the door;

switch on the lights;

sit down;
is a sequence of actions (an algorithm). Now we can construct a graph with nodes the actions (so ) and we add an edge every time there is a relation of temporal causality. For example the action follows the action , then we add add an edge starting from to . So the resulting graph (a time line) is
Then we define the TLG as the graph representing all the time lines of the players.
It is easy to imagine that in a good time line the resulting graph must be a line starting from the first action done and arriving to the last one. By the way this simple fact must be conjectured.
Principle of time linearity: Every time line of a player is a graph topologically equivalent to a chain (a line) with a starting node (called starting cause) and an ending node (called final effect).
Now let’s calculate the TLG of our game. The list of action could appear to be simple

starts the oracle ;

gets the prevision from and then it chooses;

chooses;

We have the result of the game.
So the TLG should be . But it is more complex than this. When finds what will do, it starts from arriving to . Then it does an extra step where it elaborates the answer to give to . Finally it comes back to to give the answer to . The future of now has been perturbed by the prevision, which implies we have 2 new nodes: which is the new movement of (equivalent to the node ) and which is the new outcome of the game (equivalent to the node ). The resulting graph is depicted in Fig. 2. As can be seen the TLG is not a chain, but we will see that the time line of every player it is.
Now we are ready for the time lines of every player. The player has the simplest time line, which is
This player doesn’t know what and are doing. He just waits an answer from .
The time line for is a bit more complicated. knows that the oracle will perturb the future. But is not able to follow , then he just waits an answer from . So ’s time line is then
Can be observed that is parallel to and is parallel to . So it seems that the game has two distinct outcomes, if the observer is the outcome is , while if the observer is the outcome is . To fix this problem we introduce a key concept: the entanglement between two events. We will define two events entangled if they share the same outcome. For example events and are the same event with or without the contribution of . But when makes his choice, he does not know what will choose, so has not influences on the outcome of and . Then these events must have the same outcome because they are caused by the same events. So they are entangled. We will express the entanglement with the symbol
Now we are ready to formulate an other principle.
Principle of Retrocausation: Every time that a time line has a singularity, the singularity split in two or more copies of the singular event entangled between them.
The previous principle is the one which justify the creation of the node . But we have an other problem now. The fact that and are entangled does not guarantee us that the consequences ( and ) are again entangled. So we make an other statement.
Principle of Entanglement transmission: The consequences of entangled events are again entangled.
From the previous follows that , which leads to a unique result (because of the entanglement). Then for the time line is
Let’s check it:

receives the input of ;

Then goes in future ’s choice to answer ;

elaborates the query ;

answers ;

sees entangled ’s choice ;

sees entangled result .
Then all the principles stated have been applied successfully (in particular the linearity principle). For a brief scheme of all the entanglements see Fig. 3.
5 Time unfolding
We have now all the time lines of all players. Let’s see them again
The first idea to simulate with a computer the problem could be simulate the simplest time line, so the ’s one. But using this approach we encounter an insuperable obstacle. We have not an oracle. So simulating this problem in this way is impossible. The same happens for the time line of . So the best way to do it is to take the weirdest way. Then we choose the time line of . In fact what we observe is that the event in his time line happens before the event . This simple observation leads to an notable consequence. Retrocausation has caused a twist in the time line of observer . Then causality is not an invariant for a physical systems but can be perturbed by using an oracle. This simple observation has implications in physics but these are out of our aims. By the way appear clear that we are able to write a program which simulates the game from the frame of . Thanks to time unfolding caused by the twist of the time line is possible. We expose a simple MATLAB implementation.
6 Results
Through the the MATLAB implementation has been tested the predictions of the classical theory in a numerical way. The game has been played times with a parallel code. Then the obtained utilities have been averaged. The results are shown in tables. In the first test we suppose (Random case)
Utility  

Theoretical  510000  500000 
Numerical  516480  496560 
and in the second test we suppose (Perfect predictor)
Utility  

Theoretical  10000  1000000 
Numerical  10000  1000000 
where in the second case we observe that the algorithm is deterministic. Then the algorithm proposed explains the two classical solutions, which are in the first test and in the second test.
References
 [1] Robert Nozick. Newcomb’s problem and two principles of choice. 1969.
 [2] Wandile Sihlobo. A review of game theory, 09 2013.
 [3] Robin J. Wilson. Introduction to graph theory, fourth edition, 1996.
Comments
There are no comments yet.