DOIAbstract
Pattern, Gambling teams, Waiting times, Markov chains, Martingales, Test of randomness, Primary 60C05, Primary 60G42, Secondary 60G40, Secondary 62E17,
Pattern, Gambling teams, Waiting times, Markov chains, Martingales, Test of randomness, Primary 60C05, Primary 60G42, Secondary 60G40, Secondary 62E17,
We investigate the use of Monte-Carlo Tree Search (MCTS) within the field of computer Poker, more sp...
Let prize X in a game be a random variable with a cumulative distribution function F, E[X] [not equa...
A Markov chain is a system consisting of finitely many states and a set of probabilities that dictat...
Abstract. The expected value and generating function of the number of over-lapping occurrences of a ...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Consider a gambling house where one can participate in d different games at the same time. The games...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
Following an axiomatic introduction to the prequential (predictive sequential) principle to statisti...
© 2017, The JJIAM Publishing Committee and Springer Japan KK. Using a martingale technique we derive...
In this paper we analyze the sudoku games as both fractions of designed experiments and contingency ...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
Abstract: This paper gives an outline of an interesting probability game related to coin arrangement...
The distribution of rewards in both variable-ratio and random-ratio schedules is examined with speci...
We investigate the use of Monte-Carlo Tree Search (MCTS) within the field of computer Poker, more sp...
Let prize X in a game be a random variable with a cumulative distribution function F, E[X] [not equa...
A Markov chain is a system consisting of finitely many states and a set of probabilities that dictat...
Abstract. The expected value and generating function of the number of over-lapping occurrences of a ...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Consider a gambling house where one can participate in d different games at the same time. The games...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
Following an axiomatic introduction to the prequential (predictive sequential) principle to statisti...
© 2017, The JJIAM Publishing Committee and Springer Japan KK. Using a martingale technique we derive...
In this paper we analyze the sudoku games as both fractions of designed experiments and contingency ...
Introduction Discrete-time Markov processes, or Markov chains, are a powerful tool for modeling and...
Abstract: This paper gives an outline of an interesting probability game related to coin arrangement...
The distribution of rewards in both variable-ratio and random-ratio schedules is examined with speci...
We investigate the use of Monte-Carlo Tree Search (MCTS) within the field of computer Poker, more sp...
Let prize X in a game be a random variable with a cumulative distribution function F, E[X] [not equa...
A Markov chain is a system consisting of finitely many states and a set of probabilities that dictat...
Add to ORKG