Related papers: Game-theoretic Brownian motion
We show that exact sampling of the first passage event can be done for a Levy process with unbounded variation, if the process can be embedded in a subordinated standard Brownian motion. By sampling a series of first exit events of the…
Consider the first exit time of one-dimensional Brownian motion $\{B_s\}_{s\geq 0}$ from a random passageway. We discuss a Brownian motion with two time-dependent random boundaries in quenched sense. Let $\{W_s\}_{s\geq 0}$ be an other…
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model…
In this paper, we consider a partial information two-person zero-sum stochastic differential game problem where the system is governed by a backward stochastic differential equation driven by Teugels martingales associated with a L\'{e}vy…
We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
In this short note we will provide a sufficient and necessary condition to have uniqueness of the location of the maximum of a stochastic process over an interval. The result will also express the mean value of the location in terms of the…
The assumptions of necessary rationality and necessary knowledge of strategies, also known as perfect prediction, lead to at most one surviving outcome, immune to the knowledge that the players have of them. Solutions concepts implementing…
Expanding the ideas of the author's paper 'Nonexpansive maps and option pricing theory' (Kibernetica 34:6 (1998), 713-724) we develop a pure game-theoretic approach to option pricing, by-passing stochastic modeling. Risk neutral…
Two losing gambling games, when alternated in a periodic or random fashion, can produce a winning game. This paradox has been inspired by certain physical systems capable of rectifying fluctuations: the so-called Brownian ratchets. In this…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
Real thermal motion of gas molecules, free electrons, etc., at long time intervals (much greater than mean free-flight time) possesses, contrary to its popular mathematical models, essentially non-Gaussian statistics. A simple proof of this…
The game dynamical equations are derived from Boltzmann-like equations for individual pair interactions by assuming a certain kind of imitation behavior, the so-called proportional imitation rule. They can be extended to a stochastic…
Brownian motion of a particle with an arbitrary shape is investigated theoretically. Analytical expressions for the time-dependent cross-correlations of the Brownian translational and rotational displacements are derived from the…
The approach to the theory of a relativistic random process is considered by the path integral method as Brownian motion taking into account the boundedness of speed. An attempt was made to build a relativistic analogue of the Wiener…
We prove that zero-sum Dynkin games in continuous time with partial and asymmetric information admit a value in randomised stopping times when the stopping payoffs of the players are general \cadlag measurable processes. As a by-product of…
In this paper we present a novel approach to optimise tactical and strategic decision making in football (soccer). We model the game of football as a multi-stage game which is made up from a Bayesian game to model the pre-match decisions…
We study learning in complete-information games, allowing the players' models of their environment to be misspecified. We introduce Berk--Nash rationalizability: the largest self-justified set of actions -- meaning each action in the set is…
In this paper, we extend the Descent framework, which enables learning and planning in the context of two-player games with perfect information, to the framework of stochastic games. We propose two ways of doing this, the first way…
The purpose of this paper is to provide a complete probabilistic analysis of a large class of stochastic differential games for which the interaction between the players is of mean-field type. We implement the Mean-Field Games strategy…