A Comparison of Decision Algorithms on Newcomblike Problems

Alex Altair
5/31/2023
cs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Dynamic Weights in Multi-Objective Deep Reinforcement Learning

80% match1 repo1052018

What is a decision problem?

79% match2023

Regret-Minimization Algorithms for Multi-Agent Cooperative Learning Systems

79% match2023

Minimizing the Outage Probability in a Markov Decision Process

78% match2023

The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic

77% match2 repos5092018

Discrete Versus Continuous Algorithms in Dynamics of Affective Decision Making

77% match2023

Cite this paper

@article{altair2023comparison,
  title  = {A Comparison of Decision Algorithms on Newcomblike Problems},
  author = {Alex Altair},
  year   = {2023},
  eprint = {2306.00175},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.00175v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.00175.svg)](https://codeofpaper.com/paper/2306.00175)

Discussion