A Comparison of Decision Algorithms on Newcomblike Problems

  • Altair A
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Altair, A. (2013). A Comparison of Decision Algorithms on Newcomblike Problems. Machine Intelligence Research Institute. Retrieved from https://intelligence.org/files/Comparison.pdf

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free