Random Perturbation in Games of Chance | Zendy

Fuh ChengDer | Zendy; Yeh YeongNan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Random Perturbation in Games of Chance

Author(s) -

Fuh ChengDer,

Yeh YeongNan

Publication year - 2001

Publication title -

studies in applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 46

eISSN - 1467-9590

pISSN - 0022-2526

DOI - 10.1111/1467-9590.00185

Subject(s) - counterintuitive , markov chain , phenomenon , mathematics , mathematical economics , sense (electronics) , embedding , automaton , order (exchange) , statistical physics , discrete mathematics , computer science , theoretical computer science , artificial intelligence , physics , economics , quantum mechanics , statistics , electrical engineering , engineering , finance

In this article, we consider a problem in games of chance. Our result shows that two losing games ( A and B , in the sense of a negative expectation) can become a winning game (in the sense of a positive expectation), when the two are played in a suitable alternating order; for example, ABBABB By using a regrouping technique in Automata and the concept of Markov chain embedding, we give proof of this gambling result. A signal‐to‐noise ratio is also presented to explain this counterintuitive phenomenon.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research