Information entropy and parrondo’s discrete-time ratchet

Harmer, Gregory P.; Abbott, Derek; Taylor, Peter G.; Pearce, Charles E. M.; Parrondo, Juan M. R.
February 2000
AIP Conference Proceedings;2000, Vol. 502 Issue 1, p544
Academic Journal
Parrondo’s paradox involves two losing games of chance. The paradox is that a winning situation is produced when the two games are played in a random sequence in accordance with fixed probabilities. In this paper we investigate the relationship between these parameters and the entropy rates of the games. © 2000 American Institute of Physics.


Related Articles

  • Dynamical Systems in the Variational Formulation of the Fokker--Planck Equation by the Wasserstein Metric. Mikami, T. // Applied Mathematics & Optimization;2000, Vol. 42 Issue 2, p203 

    Abstract. R. Jordan, D. Kinderlehrer, and E Otto proposed the discrete-time approximation of the Fokker-Planck equation by the variational formulation. It is determined by the Wasserstein metric, an energy functional, and the Gibbs-Boltzmann entropy functional. In this paper we study the...

  • RATES OF CONVERGENCE OF STOCHASTICALLY MONOTONE AND CONTINUOUS TIME MARKOV MODELS. Roberts, G. O.; Tweedie, R. L. // Journal of Applied Probability;Jun2000, Vol. 37 Issue 2, p359 

    Presents information on a study which gave bounds on the total variation distance from convergence of a continuous time positive recurrent Markov process on an arbitrary state space. Discussion on discrete time bounds and stochastic monotonicity; Explanation on continuous time regeneration...

  • Saddle-Point Properties and Nash Equilibria for Channel Games. Mathar, Rudolf; Schmeink, Anke // EURASIP Journal on Advances in Signal Processing;2009, Special section p1 

    In this paper, transmission over a wireless channel is interpreted as a two-person zero-sum game, where the transmitter gambles against an unpredictable channel, controlled by nature. Mutual information is used as payoff function. Both discrete and continuous output channels are investigated. We...

  • 3nj-coefficients of su(1,1) as connection coefficients between orthogonal polynomials in n variables. Lievens, S.; Van der Jeugt, J. // Journal of Mathematical Physics;Jul2002, Vol. 43 Issue 7, p3824 

    In the tensor product of n + 1 positive discrete series representations of su(1,1), a coupled basis vector can be described by a certain binary coupling tree. To every such binary coupling tree, polynomials R[sup (k)][sub l](x) and R[sup (k)][sub l] (x) are associated. These polynomials are...

  • Finite-dimensional discrete systems and integrable systems through nonlinearization of the discrete eigenvalue problem. Xianguo, Geng // Journal of Mathematical Physics;Feb93, Vol. 34 Issue 2, p805 

    A method is developed that extends the nonlinearization procedure of eigenvalue problems to the discrete case, from which the finite-dimensional discrete systems and finite-dimensional completely integrable systems associated with the Toda hierarchy are obtained. A new model for solving discrete...

  • Generalized Adjoint for Physical Processes with Parameterized Discontinuities. Part VI:... Xu, Qin; Gao, Jidong // Journal of the Atmospheric Sciences;4/1/99, Vol. 56 Issue 7, p994 

    Derives the generalized adjoint with modified discretization and generalized coarse-grain adjoint for a vector system of equations that contains parameterized on/off switches or time discontinuities. Model equations; Discrete forward and tangent linear models; Discrete adjoint and gradient...

  • Performance assessment and benchmarking LQG predictive optimal controllers for discrete-time state-space systems. Grimble, M.J. // Transactions of the Institute of Measurement & Control;2003, Vol. 25 Issue 3, p239 

    The performance assessment and benchmarking of discrete-time multivariable LQG predictive optimal control problems is considered for systems represented in state equation form. The class of predictive controllers represents the most popular multivariable design methods for the process...

  • On-line routing of random calls in networks. Luczak, Malwina J.; McDiarmid, Colin; Upfal, Eli // Probability Theory & Related Fields;2003, Vol. 125 Issue 4, p457 

    We consider a random sequence of calls between nodes in a complete network with link capacities. Each call first tries the direct link. If that link is saturated, then the `first-fit dynamic alternative routing algorithm' sequentially selects up to d random two-link alternative routes, and...

  • The discrete time version of the Romer model. Le Van, Cuong; Morhaim, Lisa; Dimaria, Charles-Henri // Economic Theory;2002, Vol. 20 Issue 1, p133 

    This paper presents a discrete time version of the Romer 1986 model of endogenous growth. The purpose of this work is to propose detailed and simple proofs of existence of optimal solutions and of a competitive equilibrium. The framework implemented here reduces the complexity of the proofs...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics