Related papers: Decision Theory in an Algebraic Setting
We present a computational model of mathematical reasoning according to which mathematics is a fundamentally stochastic process. That is, on our model, whether or not a given formula is deemed a theorem in some axiomatic system is not a…
We present a symbolic machinery that admits both probabilistic and causal information about a given domain and produces probabilistic statements about the effect of actions and the impact of observations. The calculus admits two types of…
We provide a decision-theoretic framework for dealing with uncertainty in quantum mechanics. This uncertainty is two-fold: on the one hand there may be uncertainty about the state the quantum system is in, and on the other hand, as is…
How should my own decisions affect my beliefs about the outcomes I expect to achieve? If taking a certain action makes me view myself as a certain type of person, it might affect how I think others view me, and how I view others who are…
From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…
Those articles (versions) explore a non conventional pregeometrical model encompassing quantics and geometrodynamics (a stochastic graph relational theory). Some key points are : 1) the use of simple boolean atom-like far subquantum…
We develop a qualitative model of decision making with two aims: to describe how people make simple decisions and to enable computer programs to do the same. Current approaches based on Planning or Decisions Theory either ignore uncertainty…
We show that the correct mathematical foundation of quantum decision theory, dealing with uncertain events, requires the use of positive operator-valued measure that is a generalization of the projection-valued measure. The latter is…
Modeling worlds and actions under uncertainty is one of the central problems in the framework of decision-theoretic planning. The representation must be general enough to capture real-world problems but at the same time it must provide a…
Functional decision theory (FDT) is a fairly new mode of decision theory and a normative viewpoint on how an agent should maximize expected utility. The current standard in decision theory and computer science is causal decision theory…
In this paper we present the fundamentals of the so-called algebraic approach to propositional quantum logics. We define the set of formulas describing quantum reality as a free algebra freely generated by the set of quantum propositional…
An action is a pair of sets, $C$ and $S$, and a function $f\colon C\times S \to C$. Rothschild and Yalcin gave a simple axiomatic characterization of those actions arising from set intersection, i.e.\ for which the elements of $C$ and $S$…
The aim of this paper is to present a very simple set of conditions, necessary for the management of knowledge of a poset $T$ of two agents, which are partially ordered by the capabilities available in the system. We build up a formal…
In this paper, we investigate bounded action theories in the situation calculus. A bounded action theory is one which entails that, in every situation, the number of object tuples in the extension of fluents is bounded by a given constant,…
This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…
In the present article we use the quantum formalism to describe the effects of risk and ambiguity in decision theory. The main idea is that the probabilities in the classic theory of expected utility are estimated probabilities, and thus do…
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
One purpose -- quite a few thinkers would say the main purpose -- of seeking knowledge about the world is to enhance our ability to make good decisions. An item of knowledge that can make no conceivable difference with regard to anything we…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…