English
Related papers

Related papers: Surreal Decisions

200 papers

In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale (strategy) can win an infinite amount of money by betting on…

Computer Science and Game Theory · Computer Science 2015-05-18 Laurent Bienvenu , Frank Stephan , Jason Teutsch

An approach is presented treating decision theory as a probabilistic theory based on quantum techniques. Accurate definitions are given and thorough analysis is accomplished for the quantum probabilities describing the choice between…

Artificial Intelligence · Computer Science 2022-06-06 V. I. Yukalov

We develop a systematic approach to quantum probability as a theory of rational betting in quantum gambles. In these games of chance the agent is betting in advance on the outcomes of several (finitely many) incompatible measurements. One…

Quantum Physics · Physics 2007-05-23 I. Pitowsky

This paper shows how we can combine logical representations of actions and decision theory in such a manner that seems natural for both. In particular we assume an axiomatization of the domain in terms of situation calculus, using what is…

Artificial Intelligence · Computer Science 2013-02-18 David L. Poole

We give a brief history of transcendental number theory, including Schanuel's conjecture (S). Assuming (S), we prove that if z and w are complex numbers, not 0 or 1, with z^w and w^z algebraic, then z and w are either both rational or both…

Number Theory · Mathematics 2011-03-31 Diego Marques , Jonathan Sondow

This paper presents an approach for developing the explanation capabilities of rule-based expert systems managing imprecise and uncertain knowledge. The treatment of uncertainty takes place in the framework of possibility theory where the…

Artificial Intelligence · Computer Science 2013-04-08 Henri Farrency , Henri Prade

We develop a duality theory for the problem of maximising expected lifetime utility from inter-temporal wealth over an infinite horizon, under the minimal no-arbitrage assumption of No Unbounded Profit with Bounded Risk (NUPBR). We use only…

Portfolio Management · Quantitative Finance 2020-10-13 Michael Monoyios

We pursue robust approach to pricing and hedging in mathematical finance. We consider a continuous time setting in which some underlying assets and options, with continuous paths, are available for dynamic trading and a further set of…

Mathematical Finance · Quantitative Finance 2015-07-07 Zhaoxu Hou , Jan Obloj

The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the…

Logic in Computer Science · Computer Science 2016-06-28 Patrick Girard , Marcus Anthony Triplett

There is much interest in providing probabilistic semantics for defaults but most approaches seem to suffer from one of two problems: either they require numbers, a problem defaults were intended to avoid, or they generate peculiar side…

Artificial Intelligence · Computer Science 2013-04-10 Eric Neufeld , David L Poole

Motivated by problems in insurance, our task is to predict finite upper bounds on a future draw from an unknown distribution $p$ over the set of natural numbers. We can only use past observations generated independently and identically…

Statistics Theory · Mathematics 2013-05-02 Narayana Santhanam , Venkat Anantharam

Possibilistic risk theory starts from the hypothesis that risk is modelled by fuzzy numbers. In particular, in a possibilistic portfolio choice problem, the return of a risky asset will be a fuzzy number. The expected utility operators have…

Portfolio Management · Quantitative Finance 2019-07-01 Irina Georgescu , Louis Aimé Fono

While machine-learning models are flourishing and transforming many aspects of everyday life, the inability of humans to understand complex models poses difficulties for these models to be fully trusted and embraced. Thus, interpretability…

Artificial Intelligence · Computer Science 2020-06-18 Guangyi Zhang , Aristides Gionis

Several examples are used to illustrate how we deal cavalierly with infinities and unphysical systems in physics. Upon examining these examples in the context of infinities from Cantor's theory of transfinite numbers, the only known…

Mathematical Physics · Physics 2007-05-23 P. Narayana Swamy

The ability to reason under uncertainty and with incomplete information is a fundamental requirement of decision support technology. In this paper we argue that the concentration on theoretical techniques for the evaluation and selection of…

Artificial Intelligence · Computer Science 2013-03-26 John Fox , Paul J. Krause

When humans infer underlying probabilities from stochastic observations, they exhibit biases and variability that cannot be explained on the basis of sound, Bayesian manipulations of probability. This is especially salient when beliefs are…

Neurons and Cognition · Quantitative Biology 2021-07-08 Arthur Prat-Carrabin , Florent Meyniel , Misha Tsodyks , Rava Azeredo da Silveira

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…

General Mathematics · Mathematics 2025-07-02 Arnaud Mayeux

It is well known that ex ante social preferences and expected utility are not always compatible. In this note, we introduce a novel framework that naturally separates social preferences from selfish preferences to answer the following…

Theoretical Economics · Economics 2023-12-12 Mehmet S. Ismail , Ronald Peeters

We present a novel coalgebraic formulation of infinite extensive games. We define both the game trees and the strategy profiles by possibly infinite systems of corecursive equations. Certain strategy profiles are proved to be subgame…

Computer Science and Game Theory · Computer Science 2015-07-29 Samson Abramsky , Viktor Winschel
‹ Prev 1 8 9 10 Next ›