  When formulated using Bayesian networks, two standard decision algorithms
(Evidential Decision Theory and Causal Decision Theory) can be shown to fail
systematically when faced with aspects of the prisoner's dilemma and so-called
"Newcomblike" problems. We describe a new form of decision algorithm, called
Timeless Decision Theory, which consistently wins on these problems.
