Stochastic dynamics and Parrondo's paradox (Q2477690): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.physd.2007.08.011 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2024497675 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4950474 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Walks with optimal reward on metric spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Parrondo's paradox / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parrondo's paradox. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The paradox of Parrondo's games / rank | |||
Normal rank |
Latest revision as of 19:32, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stochastic dynamics and Parrondo's paradox |
scientific article |
Statements
Stochastic dynamics and Parrondo's paradox (English)
0 references
14 March 2008
0 references
The Spanish physicist Juan Parrondo has provided two stochastic losing games such that for certain stochastic combinations one may obtain a winning game. If a large number of players are involved and if they try to play such that their gain in the next round is maximized one arrives at the problem of investigating a random walk on a certain space of measures. The appropriate abstract setting is as follows. There is given a compact metric space \((M,d)\), and \(M\) is written as the union of certain closed subsets \(A_1,\dots, A_r\). For every \(\rho=1,\dots,r\) there is prescribed a strict contraction \(\Gamma_\rho: A_\rho\to M\). A random walk \((X_m)_{m\in \mathbb{N}_0}\) on \(M\) is then defined as follows. The starting position is \(X_0=x_0\), where \(x_0\in M\) is fixed, and if the walk at the \(m\)-th step is at position \(X_m\in M\), then one chooses a \(\rho\) among the \(\rho\) with \(X_m\in A_\rho\) (with equal probability, say) and defines \(X_{m+1}\) as \(\Gamma_{\rho}(X_m)\). Associated with the walk is a gain \(\varphi(X_m)\) in every round, where \(\varphi:M\to\mathbb{R}\) is a continuous function. The aim of the present investigations is the study of the expectation \(G_m\) of \(\varphi(X_m)\) as a function of \(m\). Our main result states that the sequence \((G_m)\) is ``eventually approximately periodic'' provided that all \(A_\rho\) are not only closed but also open in \(M\): for every \(\varepsilon\) there is an \(l_o\in\mathbb{N}\) such that \((G_m)\) is \(l_0\)-periodic up to an error of at most \(\varepsilon\) for sufficiently large \(m\). In fact it turns out that the behaviour of our process can be described well with a finite Markov chain. In the general case, however, the process might behave rather chaotically. We give an example where \(M\) is the unit interval. \(M\) is written as the union of two closed subsets \(A_1,A_2\), the contractions \(\Gamma_1,\gamma_2\) are rather simple, but the expectations of the gains are not even Cesáro convergent.
0 references
stochastic dynamical system
0 references
stochastic game
0 references
fractal
0 references
Parrondo's paradox
0 references