Formalising Newcomblike Problems

This is the write-up of my MATS project so far, as a mentee of Abram Demski . Those who would prefer a more formal/academic/mathematical write-up should look at the AAMAS submission here . TL:DR, a formal framework for representing CDT, EDT and UDT on the majority of classical Newcomblike problems, plus some accompanying results about how CDT can be made to pay for ignorance. Introduction I present my framework for hosting classical decision theories (Causal, Evidential and Updtateless/Functional decision theories) in classical Newcomblike problems. The framework is intended to be faithful (the outputs of the framework regarding what theories act in which ways in which problems agree with the consenus), fair (each theory's intuitions about "why this is rational behaviour" can be expressed as formal properties of the framework, the framework tries to avoid "begging the question" in favour or against any particular theory) and computable (given a formal description of any theory and any problem (at least those that the framework can express) there is a simple algorithm do determine what that theory would do in that problem. To the best of my knowledge, there is no other framework tha