A Comparison of Decision Algorithms on Newcomblike Problems

• URL: http://arxiv.org/abs/2306.00175v1
• Date: Wed, 31 May 2023 20:50:08 GMT
• Title: A Comparison of Decision Algorithms on Newcomblike Problems
• Authors: Alex Altair
• Abstract summary: Two standard decision algorithms 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Solving Decision Theory Problems with Probabilistic Answer Set Programming [1.4999444543328293]
  We introduce the possibility to encode decision theory problems with Probabilistic Answer Set Programming. Our algorithm can manage non trivial instances of programs in a reasonable amount of time.
  arXiv  Detail & Related papers  (2024-08-21T06:44:16Z)
• Expertise Trees Resolve Knowledge Limitations in Collective Decision-Making [2.924868086534434]
  We model such changes in depth and breadth of knowledge as a partitioning of the problem space into regions of differing expertise. We provide here new algorithms that explicitly consider and adapt to the relationship between problem instances and experts' knowledge.
  arXiv  Detail & Related papers  (2023-05-02T16:59:57Z)
• Explainable Data-Driven Optimization: From Context to Decision and Back Again [76.84947521482631]
  Data-driven optimization uses contextual information and machine learning algorithms to find solutions to decision problems with uncertain parameters. We introduce a counterfactual explanation methodology tailored to explain solutions to data-driven problems. We demonstrate our approach by explaining key problems in operations management such as inventory management and routing.
  arXiv  Detail & Related papers  (2023-01-24T15:25:16Z)
• Socio-cognitive Optimization of Time-delay Control Problems using Evolutionary Metaheuristics [89.24951036534168]
  Metaheuristics are universal optimization algorithms which should be used for solving difficult problems, unsolvable by classic approaches. In this paper we aim at constructing novel socio-cognitive metaheuristic based on castes, and apply several versions of this algorithm to optimization of time-delay system model.
  arXiv  Detail & Related papers  (2022-10-23T22:21:10Z)
• Attribute reduction and rule acquisition of formal decision context based on two new kinds of decision rules [1.0914300987810128]
  The premises of I-decision rules and II-decision rules are object-oriented concepts. The attribute reduction approaches to preserve I-decision rules and II-decision rules are presented.
  arXiv  Detail & Related papers  (2021-07-04T02:55:24Z)
• Modularity in Reinforcement Learning via Algorithmic Independence in Credit Assignment [79.5678820246642]
  We show that certain action-value methods are more sample efficient than policy-gradient methods on transfer problems that require only sparse changes to a sequence of previously optimal decisions. We generalize the recently proposed societal decision-making framework as a more granular formalism than the Markov decision process.
  arXiv  Detail & Related papers  (2021-06-28T21:29:13Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• Algorithmic Challenges in Ensuring Fairness at the Time of Decision [6.228560624452748]
  Algorithmic decision-making in societal contexts can be framed as optimization under bandit feedback. Recent lawsuits accuse companies that deploy algorithmic pricing practices of price gouging. We introduce the well-studied fairness notion of envy-freeness within the context of convex optimization.
  arXiv  Detail & Related papers  (2021-03-16T19:06:28Z)
• Decision-Making Algorithms for Learning and Adaptation with Application to COVID-19 Data [46.71828464689144]
  This work focuses on the development of a new family of decision-making algorithms for adaptation and learning. A key observation is that estimation and decision problems are structurally different and, therefore, algorithms that have proven successful for the former need not perform well when adjusted for decision problems.
  arXiv  Detail & Related papers  (2020-12-14T18:24:45Z)
• Towards Meta-Algorithm Selection [78.13985819417974]
  Instance-specific algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidates. We show that meta-algorithm-selection can indeed prove beneficial in some cases.
  arXiv  Detail & Related papers  (2020-11-17T17:27:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.