Next Article in Journal
Improving the Performance of MapReduce for Small-Scale Cloud Processes Using a Dynamic Task Adjustment Mechanism
Next Article in Special Issue
An Integrated Two-Level Integer Linear Program (ILP) Model for Elective Surgery Scheduling: A Case Study in an Italian Hospital
Previous Article in Journal
Convection in a Ferromagnetic Fluid Layer Influenced by Changeable Gravity and Viscosity
Previous Article in Special Issue
Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Shifted Brownian Fluctuation Game

by
Song-Kyoo (Amang) Kim
Faculty of Applied Sciences, Macao Polytechnic University, R. de Luis Gonzaga Gomes, Macao SAR, China
Mathematics 2022, 10(10), 1735; https://doi.org/10.3390/math10101735
Submission received: 19 April 2022 / Revised: 12 May 2022 / Accepted: 16 May 2022 / Published: 19 May 2022
(This article belongs to the Special Issue Operations Research and Optimization)

Abstract

:
This article analyzes the behavior of a Brownian fluctuation process under a mixed strategic game setup. A variant of a compound Brownian motion has been newly proposed, which is called the Shifted Brownian Fluctuation Process to predict the turning points of a stochastic process. This compound process evolves until it reaches one step prior to the turning point. The Shifted Brownian Fluctuation Game has been constructed based on this new process to find the optimal moment of actions. Analytically tractable results are obtained by using the fluctuation theory and the mixed strategy game theory. The joint functional of the Shifted Brownian Fluctuation Process is targeted for transformation of the first passage time and its index. These results enable us to predict the moment of a turning point and the moment of actions to obtain the optimal payoffs of a game. This research adapts the theoretical framework to implement an autonomous trader for value assets including stocks and cybercurrencies.

1. Introduction

Random walk is a stochastic process for determining the probable position of a particle by given probabilities of moving some distance in some direction [1]. It describes the particle that moves through a deterministic single or multiple dimensional integer lattice one step at a time [2]. There have been many variants of the random walk in the literature, and these variants include adding fluctuations [3,4,5,6], dependent random variables [7] and combining exit and return to a fixed set [8,9,10]. Although stochastic fluctuation is a classical topic, it is still one of the popular subjects to be applied into various areas even in the present years [11,12]. Random walks are also applied into various areas, including decision support systems [10,13,14,15,16], computer visions [17,18,19,20,21], social network analysis [22] and knowledge discovery [23]. The Brownian motion process is a Wiener stochastic process which is the random motion of a particle suspended in a medium [24,25,26]. The Wiener stochastic process is a continuous-space and continuous-time process, which can be motivated by a simple random walk [27]. This process presents a stochastic motion of particles induced by random collisions with molecules [28,29]. An important characteristic of an active Wiener process is the probability distribution of fluctuations in the displacement of particles [24]. The combination of a random walk and a fluctuation model has evolved in various ways during the last four decades [30,31]. As a consequence of the central limit theorem, typical fluctuations during long time intervals can be well described by a Gaussian distribution [32], and inside every one-dimensional Wiener process is a simple random walk. These fit together in a coherent way to skeleton forms for the Brownian motion [7].
This research proposes an alternative variant of a one-dimensional Wiener process which can describes the random positions with containing ups and downs. The Shifted Brownian Fluctuation Process (SBFP) which is a compound Wiener process with state-dependent conditions has been designed to predict the turning points of a stochastic process. The SBFP that also combined with the first exceed theory is able to find the first moment of a turning point: either a concave or a convex shape. The first exceed theory is that the compound process evolves until one of its marks hits (i.e., reaches or exceeds) its associated level for the first time, and the process will evolve until one of the components hits its assigned level for the first time [33]. The first exceed theory delivers a closed joint functional to predict the moment of the first observed threshold [34,35], which is crossing a turning point of the SBFP.
On the other hand, game theory has been applied for various strategic situations and also developed to solve real-world issues innovatively [36,37,38,39,40]. Game theory is the study of mathematical models of strategic interactions among rational decision-makers and a mixed strategy is an assignment of a probability to each pure strategy [41]. When enlisting mixed strategy, it is often because the game does not allow for a rational description in specifying a pure strategy for the game. This allows for a player to randomly select a pure strategy [41]. Since probabilities are continuous, there are infinitely many mixed strategies available to a player. Since probabilities are being assigned to strategies for a specific player when discussing the payoffs of certain scenarios, the payoff must be referred to as an expected payoff. A mixed game strategy could be constructed on the top of a SBFP, which represents any random changes including economic changes, oil market changes and stock market changes. This two-player game is targeted to find a best strategy from the payoff matrix when the decision is made one step prior to hitting the first turning point. The Shifted Brownian Fluctuation Game (SBFG) is this two-person mixed strategy game with the parameters from the functional of a SBFP in a payoff matrix.
The main contribution of this research is designing the innovative game frame which could be applied into any Brownian-based process to find the critical moment to take an action. In the stock market case, this is one step prior to hitting the peaks to sell stocks (or to hitting the bottom to buy stocks). The explicit functional could analytically predict the moments of turning points and the moments of actions (i.e., one step prior to the first turning point). This research adapts the theoretical framework to implement an autonomous trader for value assets.
The paper is organized as follows: Section 2 presents a model of SBFP where the decision making occurs according to a marked point process in time, with one-dimensional marks presenting the cumulative success probabilities up to the turning point. A joint functional of each component has been delivered as the process at the first passing of the turning point and at one step prior to this. This section also contains the practical implications to understand this new model more properly. In Section 3, the special case of an SBFG is covered. It demonstrates how the SBFP and its game (SBFG) could be applied in the stock market exchange. Lastly, the conclusion is presented in Section 4.

2. Shifted Brownian Fluctuation Game

The Shifted Brownian Fluctuation Game predicts turning points and evolves until it reaches one step prior to the turning point. This game model consists of two players with mixed strategies, and the explicit function (Theorem–SBFP) gives the predicted moment of one step prior to the first turning point of the process.

2.1. Shifted Brownian Fluctuation Process

The Shifted Brownian Fluctuation Process (SBFP) is a compound Brownian motion process with state-dependent conditions. Before formulating the SBFP, a simple Brownian motion process Y s is denoted as follows:
Y s = χ k = 1 X k · 1 k s Δ s
where
X k = + 1 , k - th step is to length χ is to up , 1 , k - th step is to down
and Δ s is the unit time to take the step. Suppose X k is assumed to be independent with fair probabilities:
P X k = 1 = P X k = 1 = 1 2 .
From (1), the variant of the Brownian motion process a s (i.e., SBFP) is as follows:
a s = a 0 · s + Y s ,
where a 0 is the mean of the step changes when a Brownian motion process is moving within the time s. Since Y s is normally distributed with zero mean and variance σ 2 s when Δ s 0 , this process is basically the same as a Brownian motion process except for “shifting” the mean in a timely manner with the slope w and W s N a 0 s , σ 2 s . All processes for the SBFP are defined on a probability space Ω , F , P and F A , F τ F Ω are σ -subalgebras [33,39]. The process (4) is observed at random moments in accordance with the point process:
T = n = 0 ε τ n , τ 0 = 0 ,
and from (4),
W n : = a τ n = w n τ n + Y τ n .
From (1), (5) and (6), the Shifted Brownian Fluctuation Process (SBFP) is defined as follows:
A τ = k 0 W k ε τ k = A 0 + k = 1 n w k Δ k + Y τ n ,
where w k , k = 1 , 2 , , w 0 = 0 are the statement-dependent constant values of SBFP with the notation
τ k = τ 0 + Δ 1 + Δ 2 + + Δ k ,
Δ k : = τ k τ k 1 , k = 0 , 1 , , τ 1 = 0 .
From (9), the following functionals can be evaluated as follows:
γ v , θ = E e v W k θ Δ k , Re v 0 , Re θ 0 .
and the marginal Laplace–Stieltjes transform by adapting the double expectation is applied as follows:
γ k ω , θ = E E e ω W k θ Δ k | Δ k = E E e ω w k e ω 2 σ 2 2 Δ k e θ Δ k | Δ k = E E e ω w k + ω 2 σ 2 2 + θ Δ k | Δ k = δ w k ω + σ 2 2 ω 2 + θ .
Therefore, we have
γ k ω , θ = δ w k ω + σ 2 2 ω 2 + θ ,
where
E e ω W k θ Δ k | Δ k = E e ω a n 0 Δ n + Y Δ n θ Δ k | Δ k , δ θ = E e θ Δ 1 .
Analogously, we can also find
γ 0 ω , θ = E E e ω A 0 θ τ 0 | τ 0 = δ 0 A 0 ω + σ 2 2 ω 2 + θ ,
where δ 0 θ = E e θ τ 0 and the SBFP is ended when A τ passes the first turning point with the correspond time h * . With S = [ 0 , h * ) , h * R + , we focused the time of turning points upon its escape from S. To formalize this model, the exit index is introduced as follows:
ν : = inf k : τ k h * , Re h * > 0 ,
and τ ν is the exit time or first passage time and A ν is the position of the fluctuation at τ ν . The actual moment of hitting the turning point is h * , and the first exceed value could be either a maximum (a concave shape process which is monotony decreased before h * ) or a minimum (a convex shape process which is monotony increased before h * ). A SBFP is terminated when W ν < w ν happens for the first time for a concave shape process ( W ν > w ν for a convex shape process) (see Figure 1).
The process is terminated at time τ ν . The associated exit time from the confined SBFP and the Formula (7) will be modified as
A ^ τ = k = 0 ν W k ε τ k ,
which is the path of the SBFP from F Ω W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν for a concave shape process (or F Ω W 1 < w 1 , W 2 < w 2 , , W ν 1 < w ν 1 W ν > w ν for a convex shape). It gives an exact definition of the process observed until τ ν . The functional
Φ ν = Φ ν u , v , ϑ , θ
(for a concave-shaped process)
= E e u A ν 1 e v A ν e ϑ τ ν 1 e θ τ ν 1 W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν
or (for a convex-shaped process)
= E e u A ν 1 e v A ν e ϑ τ ν 1 e θ τ ν 1 W 1 < w 1 , W 2 < w 2 , , W ν 1 < w ν 1 W ν > w ν .
A shape of the process is determined by w 1 :
S h a p e = C o n c a v e , w 1 > 0 , C o n v e x , w 1 < 0 .
because a SBFP is monotonic for either shape. The latter is of particular interest; we are interested in the observation moment of passing the turning point and one observation prior to this. The Theorem-SBFP establishes an explicit formula for Φ ν from (16)–(18). The Laplace–Carson transform is applied as follows:
L ^ h x = x h = 0 e x h d h , Re x > 0 ,
with the inverse
L ^ x 1 h = L 1 1 x ,
where L 1 is the inverse of the bivariate Laplace transform [33,34,39].
Theorem 1
(i.e., Theorem–SBFP). The functional Φ ν of the SBFP on σ-algebra
F Ω W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν satisfies the following formula:
Φ ν = L ^ h 1 ψ 0 ψ 1 γ 0 · ϕ 2 φ 2 2 φ Γ 0 Γ 1 h * .
Proof. 
Introduce the families:
ν h = inf n : τ n > h .
Application for L ^ p q to Φ μ p ν q will bypass all terms except for
W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν . Thus, applying operator L ^ h to random set 1 ν h = k : h 0 , we arrive at
L ^ h 1 ν h = k x = e x τ k 1 e x τ k ,
and it is additionally noted that
E 1 W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν = 1 2 ν
because
W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν = Y Δ 1 > 0 , Y Δ 2 > 0 , , Y Δ ν 1 > 0 Y Δ ν 1 < 0
and
E 1 Y Δ k > 0 = E 1 Y Δ k < 0 = 1 2 .
Similarly, we can conclude the same answer for the convex shape process:
E 1 W 1 < w 1 , W 2 < w 2 , , W ν 1 < w ν 1 W ν > w ν = 1 2 ν .
To prove Formula (24), it is noted that
1 ν h = k = 1 τ k 1 h 1 τ k > h ,
and iterating the integral of (20) from (29)
L ^ h 1 ν h = k x = x h = τ k 1 τ k e x h d h ,
which yields (24). Let us consider
Ψ x : = L ^ h Φ ν h x .
From (17), we have
Φ ν = E e u A ν 1 e v A ν e ϑ τ ν 1 e θ τ ν 1 W 1 > w 1 , W 2 > w 2 , , W ν 1 > w ν 1 W ν < w ν
then, due to (25), (28) and (31),
Ψ x = k = 0 E e u + v A k 1 e ϑ + θ τ k 1 e v a k e θ ω k 1 2 k e x τ k 1 e x τ k = k = 0 E [ e u + v A 0 e ϑ + θ τ 0 e u + v a 1 + a 2 + + a k 1 · e ϑ + θ ω 1 + ω 2 + + ω k 1 e v a k e θ ω k 1 2 k e x τ k 1 1 e x ω k ] = k = 0 γ 0 u + v , ϑ + θ + x j = 1 k 1 γ j u + v , ϑ + θ + x 1 2 k γ k v , θ 1 e x ω k
(from (12) and (13))
= k = 0 { γ 0 u + v , ϑ + θ + x γ ^ u + v , ϑ + θ + x k 2 1 2 k · γ k 1 u + v , ϑ + θ + x γ k v , θ 1 e x ω k }
because
j = 1 k 1 γ j v , θ = j = 1 k 2 γ j v , θ γ k 1 v , θ = γ ^ v , θ k 2 γ k 1 v , θ
where
γ ^ v , θ k 2 : = δ w ¯ · ω + σ 2 2 ω 2 + θ k 2 ,
w ¯ = 1 k 2 j = 1 k 2 w j .
Continuing from (33),
= ψ 0 ψ 1 + γ 0 2 · φ k = 1 φ 2 k 1 ϕ · Γ 0 Γ 1 = ψ 0 ψ 1 + γ 0 · ϕ 4 φ 2 φ 2 Γ 0 Γ 1 ,
then we can finally get the Formula (22) from (31):
Φ ν = L ^ h 1 ψ 0 ψ 1 γ 0 · ϕ 2 φ 2 2 φ Γ 0 Γ 1 h * ,
where
ψ 0 = γ 0 v , θ ,
ψ 1 = γ 0 v , θ + x ,
γ 0 = γ 0 u + v , ϑ + θ + x ,
ϕ = γ ν 1 u + v , ϑ + θ + x ,
φ = γ ^ u + v , ϑ + θ + x ,
Γ 0 = γ ν v , θ ,
Γ 1 = γ ν v , θ + x .
The moment of the first turning point h * is found as follows:
h * = h : d d h u σ h ; u , 0 , 0 , 0 | u = 0 = 0 ,
where
σ h ; u , v , θ , ϑ = L ^ h 1 ψ 0 ψ 1 γ 0 · ϕ 2 φ 2 2 φ Γ 0 Γ 1 h .
The functional Φ ν contains all decision-making parameters regarding this standard stopping game. The information includes the first moments of a turning point ( τ ν ), the moment of one step prior to passing the highest peak ( τ ν 1 ) and so on. The information from the closed functional are as follows:
E A ν 1 = lim u 0 u Φ ν u , 0 , 0 , 0 ,
E τ ν 1 = lim θ 0 θ Φ ν 0 , 0 , θ , 0 ,
E A ν = lim v 0 v Φ ν 0 , v , 0 , 0 ,
E τ ν = lim θ 0 θ Φ ν 0 , 0 , 0 , θ ,
E ν = E τ ν Δ 1 .

2.2. Shifted Brownian Fluctuation Game

A mixed game strategy could be constructed based on an SBFP that represents random changes including economic changes, oil market changes and stock market changes. This two-player game is targeted to find a payoff matrix when the decision is made at one step prior to hit the first peak at h * (see Figure 2). The Shifted Brownian Fluctuation Game (SBFG) is the two-person mixed strategy game with the values from an SBFP in a payoff matrix.
The players of this game are usually an uncontrollable subject (i.e., a nature, a market, an economy) verses a controller (i.e., a human, a company, a government). A controller (i.e., player 1) responds based on uncontrollable stochastic changes from an opponent player (i.e., player 2). In the SBFG, the decision is made at τ ν 1 , and the reward (payoff) of each player is determined after passing the peak (in a concave-shaped SBFP). The normal of the game is:
Players : N = 1 , 2 ,
Strategy   sets : s 1 = Hold , Action , s 2 = Up , Down .
Based on the above conditions, the general cost matrix at the prior time to passing the first turning point at τ ν 1 could be composed in Table 1 and the mixed strategy of player 1 in the SBFG is as follows:
p 0 = A 0 w ν + 2 A 0 , p 1 = w ν + A 0 w ν + 2 A 0 , p 1 = 1 p 0 ,
where
p 0 : = P s 1 = Hold , p 1 : = P s 1 = Action ,
μ ¯ : = E A ν 1 A 0 + E ν 2 w ¯ + w ν 1 .
Additionally, the mixed strategy of player 2 is:
q 0 = q 1 = 1 2 , q 1 = 1 q 0 ,
where
q 0 : = P s 2 = Up , q 1 : = P s 2 = Down .

3. Special Case: Memoryless Observation Process

Let us consider that the observation process has the memoryless property. This case is very practical for actual implementation of the SBFG because this property implies that the history of a SBFP is not considered. The moment of the decision making τ ν 1 and the first exceed level index ν could be calculated from (46) and (49). Recalling from (20) and (21), the operator L ^ h is determined as follows:
G x = L ^ h f h x ,
and
f h = L ^ x 1 G x .
It is also noted that Formulas (11)–(13) could be rewritten as follows:
δ θ = E e θ Δ 1 = 1 + δ ¯ · θ 1 ,
δ 0 θ = E e θ τ 0 = 1 + δ 0 ¯ · θ 1 ,
δ ¯ = E Δ 1 , δ 0 ¯ = E τ 0
γ 0 u , x = 1 + δ 0 ¯ · σ 2 2 u 2 + A 0 u + x 1
γ ν u , x = 1 + δ ¯ · σ 2 2 u 2 + w ν u + x 1
γ ν 1 u , x = 1 + δ ¯ · σ 2 2 u 2 + w ν 1 · u + x 1
γ ^ u , x = 1 + δ ¯ · σ 2 2 u 2 + w ¯ u + θ 1
Let us consider a monotonic increased SBFP (i.e., a concave-shaped process) for this case. From (32), we can find
E e u A ν 1 = Φ ν u , 0 , 0 , 0 = L x 1 Ψ x ,
and
Ψ x = 1 γ 0 0 , x 1 2 γ 0 u , x γ ν 1 u , x 1 γ ν 0 , x γ ^ u , x 2 2 · γ ^ u , x
= G 0 + G 1 2 1 + D 2 2 D + 1 1 + D 0 1 + D 2 ,
where
G 0 = δ 0 ¯ · x δ 0 ¯ · x + 1 , G 1 = δ ¯ · x δ ¯ · x + 1 , D = δ ¯ · σ 2 2 u 2 + w ¯ · u + x ,
D 0 = δ 0 ¯ · σ 2 2 u 2 + A 0 u + x , D 2 = δ ¯ · σ 2 2 u 2 + w ν 1 · u + x .
Let us consider D 0 = D (i.e., A 0 = w ¯ , δ 0 ¯ = δ ¯ ); then,
Ψ x = G 0 + G 1 2 · Y
where
Y = 1 2 δ ¯ 1 2 κ · u + 1 x + σ 2 2 u 2 + w ¯ · u + 1 2 δ ¯ 2 δ ¯ κ · u 2 δ ¯ κ · u + 1 x + σ 2 2 u 2 + w ν 1 u + 1 δ ¯ ,
and κ = w ν 1 w ¯ . For (67) and (68), we have:
Φ ν u , 0 , 0 , 0 = L x 1 G 0 · 1 x + 1 2 L x 1 G 1 · Y · 1 x = L 0 + 4 δ ¯ 1 L 1
where
L 0 = L x 1 G 0 · 1 x h * = L x 1 x + 1 δ 0 ¯ 1 = e 1 δ 0 ¯ h * ,
L 1 = 2 κ · u + 1 1 σ 2 2 u 2 + w ¯ · u + 1 2 δ ¯ 1 e 1 δ ¯ h * e σ 2 2 u 2 + w ¯ · u + 1 2 δ ¯ h * 2 δ ¯ κ 2 δ ¯ κ · u + 1 σ 2 2 u + μ ν 1 1 e 1 δ ¯ h * e σ 2 2 u 2 + w ν 1 u + 1 δ ¯ h *
.
From (43), (44) and (73)–(75),
σ 1 h : = lim u 0 u σ h ; u , 0 , 0 , 0 = 1 4 δ ¯ R 1 + R 2 ,
where
R 1 = 2 δ ¯ · w ¯ · h e 1 2 δ ¯ h 2 δ ¯ 2 w ν 1 3 w ¯ e 1 δ ¯ h e 1 2 δ ¯ h ,
R 2 = 2 · δ ¯ w ν 1 w ¯ · h e 1 δ ¯ h .
From (43), (44) and (76), we can find the optimal moment of turning point h * by solving the following equation of h:
d σ 1 h d h = 0 .
From (79), we find the solution of the following equation:
0 = w ¯ 4 δ ¯ h + w ν 1 2 δ ¯ 3 4 δ ¯ + 1 2 w ¯ e 1 2 δ ¯ h w ν 1 w ¯ 2 δ ¯ h 1 2 + 1 δ ¯ w ν 1 1 2 + 3 2 δ ¯ w ¯ e 1 δ ¯ h
.and the solution of (80) is as follows:
h * = h 0 : A · e 1 2 δ ¯ h = U h h V , V R + ,
where
U = 2 + δ ¯ w ν 1 3 + δ ¯ w ¯ w ¯ w ν 1 , U < 0 ,
V = 3 + 2 δ ¯ w ¯ 2 w ν 1 w ¯ , V < 0 ,
A = w ¯ 2 w ν 1 w ¯ , A > 0 ,
From (82)–(84), we can find the condition of a first turning point as follows:
3 + δ ¯ 2 + δ ¯ w ¯ w ν 1 3 + 2 δ ¯ 2 w ¯ .
Finding the optimal moment of making a decision is straight forward, and the demonstration is provided by computing (see Figure 3).
Upon the setup for the demonstration, the optimal moment of the turning point is 2.49 ( = h * ) which actually determined the joint functional from (22), which represents all probability information of the SBFP (i.e., A ν 1 , τ ν 1 , A ν , τ ν ) by putting h * = 2.49 .
The above special case is actually describing a monthly stock market prediction, and the moment h * indicates the moment of the first peak point, which is mentioned in Figure 3 ( = 2.49 (month)). The mean of observation duration is 1.2 (month) and the one step prior to hitting the first peak of the stock τ ν 1 is 2.40 (month) (i.e., τ ν 1 = 2.4 ). We could find the condition of stock changes that indicates passing the turning point at the next observation time τ ν , which is the moment of selling the stocks. In the case of a stock bull market in Figure 1a, the stocks are predicted to be dropped (i.e., passing a turning point) at the k-th observation moment if the net benefit of the stock w k satisfies the following condition from (85):
w k 1.5 + δ ¯ w ¯ ,
where w ¯ from (35). Then, we can conclude k = ν 1 and the k-th observation time is the moment of selling the stocks because τ ν 1 is one step prior to the first turning point h * (i.e., τ ν 1 ( = 2.4 ) h * ( = 2.49 ) τ ν ) from (86).

4. Conclusions

A new type of a mixed strategic game has been studied. The objective of this paper is establishing the theoretical framework of the Shifted Brownian Fluctuation Game for constructing the explicit solutions. The core parts of the research including the proof of the Theorem–SBFP, the analytic functionals for the decision-making parameters and the special case are fully deployed in this research. A joint functional of the standard stopping the game has analyzed the best strategies of players and optimal moments of actions. Compact closed forms from the Laplace–Carson transforms were obtained. Although the Shifted Brownian Fluctuation Game is mathematically proven, it is not yet practically implemented, which remains the limitation of this research. Hence, this game framework could be enhanced as future research topics by adapting real-world applications including stock exchanges based on setting up the initial parameters based on the real measured data.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

There are no available data to be stated.

Acknowledgments

Special thanks to the referees, whose comments are very constructive.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Britannica. Available online: https://www.britannica.com/science/random-walk (accessed on 1 May 2022).
  2. Dshalalow, J.H.; White, R.T. Current Trends in Random Walks on Random Lattices. Mathematics 2021, 9, 1148. [Google Scholar] [CrossRef]
  3. Andersen, E.S. On the fluctuations of sums of random variables. Math. Scand. 1953, 1, 263. [Google Scholar] [CrossRef] [Green Version]
  4. Andersen, E.S. On the fluctuations of sums of random variables II. Math. Scand. 1954, 2, 194. [Google Scholar] [CrossRef] [Green Version]
  5. Takacs, L. On fluctuations of sums of random variables. In Studies in Probability and Ergodic Theory. Adv. Math. 1978, 2, 45–93. [Google Scholar]
  6. Takacs, L. Random walk on a finite group. Acta Sci. Math. 1983, 45, 395–408. [Google Scholar]
  7. Takacs, C. Biased random walks on directed trees. Probab. Theory Relat. Fields 1983, 111, 123–139. [Google Scholar] [CrossRef]
  8. Dshalalow, J.H.; Syski, R. Lajos Takacs and his work. J. Appl. Math. Stoch. Anal. 1994, 7, 215–237. [Google Scholar] [CrossRef] [Green Version]
  9. Van den Berg, M. Exit and Return of a Simple Random Walk. Potential Anal. 2005, 23, 45–53. [Google Scholar] [CrossRef]
  10. Gori, M.; Pucci, A.; Roma, V.; Siena, I. Itemrank: A random-walk based scoring algorithm for recommender engines. In Proceedings of the International Joint Conference on Artificial Intelligence, Hyderabad, India, 6–12 January 2007; Volume 7, pp. 2766–2771. [Google Scholar]
  11. Baron, J.W.; Galla, T. Stochastic fluctuations and quasipattern formation in reaction-diffusion systems with anomalous transport. Phys. Rev. E 2019, 99, 052124. [Google Scholar] [CrossRef] [Green Version]
  12. Chanu, A.L.; Bhadana, J.; Singh, R.B. Stochastic fluctuations as a driving force to dissipative non-equilibrium states. J. Phys. A Math. Theor. 2020, 53, 425002. [Google Scholar] [CrossRef]
  13. Gori, M.; Pucci, A. Research paper recommender systems: A randomwalk based approach. In Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, Hong Kong, China, 18–22 December 2006; pp. 778–781. [Google Scholar]
  14. Xia, F.; Liu, H.; Lee, I.; Cao, L. Scientific article recommendation: Exploiting common author relations and historical preferences. IEEE Trans. Big Data 2006, 2, 1010–1112. [Google Scholar] [CrossRef]
  15. Xia, F.; Chen, Z.; Wang, W.; Li, J.; Yang, L.T. MVCWalker: Random walk-based most valuable collaborators recommendation exploiting academic factors. IEEE Trans. Emerg. Top. Comput. 2014, 2, 364–375. [Google Scholar] [CrossRef]
  16. Sarkar, P.; Moore, A. A tractable approach to finding closest truncatedcommute-time neighbors in large graphs. arXiv 2012, arXiv:1206.5259. [Google Scholar]
  17. Shen, J.; Du, Y.; Wang, W.; Li, X. Lazy random walks for superpixel segmentation. IEEE Trans. Image Process. 2014, 23, 1451–1462. [Google Scholar] [CrossRef]
  18. Meila, M.; Shi, J. A random walks view of spectral segmentation. In Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, Key West, FL, USA, 4–7 January 2001; pp. 177–182. [Google Scholar]
  19. Gorelick, L.; Galun, M.; Sharon, E.; Basri, R.; Brandt, A. Shape representation and classification using the Poisson equation. IEEE Trans. Pattern Anal. Mach. Intell. 2016, 28, 1991–2005. [Google Scholar] [CrossRef] [Green Version]
  20. Grady, L. Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 2006, 28, 1768–1783. [Google Scholar] [CrossRef] [Green Version]
  21. Grady, L. Multilabel random walker image segmentation using prior models. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Diego, CA, USA, 20–25 June 2005; Volume 1, pp. 763–770. [Google Scholar]
  22. Sarkar, P.; Moore, A.W. Random walks in social networks and their applications: A survey. In Social Network Data Analytics; Springer: Berlin, Germany, 2011; pp. 43–77. [Google Scholar]
  23. de Arruda, H.F.; Silva, F.N.; Costa, L.D.F.; Amancio, D.R. Knowledge acquisition: A complex networks approach. Inf. Sci. 2017, 421, 154–166. [Google Scholar] [CrossRef] [Green Version]
  24. Lalle, S. Brownian Motion, Lecture Note. 2012. Available online: https://galton.uchicago.edu/~lalley/Courses/313/ (accessed on 1 May 2022).
  25. Ermogenous, A. Brownian Motion and Its Applications in the Stock Market. In Undergraduate Mathematics Day: Proceedings and Other Materials; University of Dayton: Dayton, OH, USA, 2006; Volume 15. [Google Scholar]
  26. Shreve, S. Stochastic Calculus for Finance II Continuous Time Models; Springer: New York, NY, USA, 2004. [Google Scholar]
  27. Feynman, R. Lecture Notes on Physics. 1964. Available online: https://www.feynmanlectures.caltech.edu/I_41.html (accessed on 1 May 2022).
  28. Metcalfe, G.; Speetjens, M.F.; Lester, D.R.; Clercx, H.J.H. Beyond Passive: Chaotic Transport in Stirred Fluids. Adv. Appl. Mech. 2012, 45, 109–188. [Google Scholar]
  29. Gensdarme, F. Methods of Detection and Characterization. Nanoengineering 2015, 55–84. [Google Scholar]
  30. Alili, L.; Chaumont, L.; Dony, R.A. On A Fluctuation Identity For Random walks and Levy Processes. Bull. Lond. Math. Soc. 2005, 37, 141–148. [Google Scholar] [CrossRef]
  31. Mardoukhi, Y.; Jeon, J.H.; Chechkin, A.V.; Metzler, R. Fluctuations of random walks in critical random environments. Phys. Chem. Chem. Phys. 2018, 20, 20427–20438. [Google Scholar] [CrossRef]
  32. Pietzonka, P.; Kleinbeck, K.; Seifert, U. Extreme fluctuations of active Brownian motion. New J. Phys. 2016, 18, 052001. [Google Scholar] [CrossRef] [Green Version]
  33. Dshalalow, J.H. First excess levels of vector processes. J. Appl. Math. Stoch. Anal. 1994, 7, 457–464. [Google Scholar] [CrossRef] [Green Version]
  34. Kim, S.-K. A Versatile Stochastic Duel Game. Mathematics 2020, 8, 678. [Google Scholar] [CrossRef]
  35. Kim, S.-K. Antagonistic One-To-N Stochastic Duel Game. Mathematics 2020, 8, 1114. [Google Scholar] [CrossRef]
  36. Moschini, G. Nash equilibrium in strictly competitive games: Live play in soccer. Econ. Lett. 2004, 85, 365–371. [Google Scholar] [CrossRef]
  37. Kim, S.-K. Blockchain Governance Game. Comp. Indust. Eng. 2019, 136, 373–380. [Google Scholar] [CrossRef] [Green Version]
  38. Kim, S.-K. Strategic Alliance For Blockchain Governance Game. Probab. Eng. Inf. Sci. 2022, 36, 184–200. [Google Scholar] [CrossRef]
  39. Dshalalow, J.H.; Ke, H.-J. Layers of noncooperative games. Nonlinear Anal. 2009, 71, 283–291. [Google Scholar] [CrossRef]
  40. Kim, S.-K. Multi-Layered Blockchain Governance Game. Axioms 2022, 11, 27. [Google Scholar] [CrossRef]
  41. Polak, B. Discussion of Duel. Open Yale Courses. 2008. Available online: http://oyc.yale.edu/economics/econ-159/ (accessed on 1 May 2022).
Figure 1. Convex shape and concave shape processes.
Figure 1. Convex shape and concave shape processes.
Mathematics 10 01735 g001
Figure 2. SBFP on NASDAQ 100 stock chart for 6 months (Source: etoro.com).
Figure 2. SBFP on NASDAQ 100 stock chart for 6 months (Source: etoro.com).
Mathematics 10 01735 g002
Figure 3. Find the optimal moment h * using Matlab.
Figure 3. Find the optimal moment h * using Matlab.
Mathematics 10 01735 g003
Table 1. Cost matrix.
Table 1. Cost matrix.
UpDown
Hold w ν w ν
Action 1 w ν + 1 A 0 1 1 w ν 1 A 0 1
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kim, S.-K. Shifted Brownian Fluctuation Game. Mathematics 2022, 10, 1735. https://doi.org/10.3390/math10101735

AMA Style

Kim S-K. Shifted Brownian Fluctuation Game. Mathematics. 2022; 10(10):1735. https://doi.org/10.3390/math10101735

Chicago/Turabian Style

Kim, Song-Kyoo (Amang). 2022. "Shifted Brownian Fluctuation Game" Mathematics 10, no. 10: 1735. https://doi.org/10.3390/math10101735

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop