On two combination rules for 0-1-sequences (Q1815270)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1815270 |
scientific article; zbMATH DE number 942755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On two combination rules for 0-1-sequences |
scientific article; zbMATH DE number 942755 |
Statements
On two combination rules for 0-1-sequences (English)
0 references
2 December 1996
0 references
Two players compete with each other by successively taking part in a series of win-or-lose games for one person. The player having more successes at the end is the winner, where the two termination rules (i) stop as soon as one player has reached \(N\) successes and (ii) stop after the \(N\)th trial are considered. The effect of the following two switching rules is studied: (1) alternate between the players, (2) the current player continues iff he or she was successful in the last trial. The aim of the paper is to derive surprisingly simple relations between the corresponding sets of winning sequences of trials and, in the case that the outcomes of the trials are random, between the probabilities of winning.
0 references
0-1-sequence
0 references
series of win-or-lose games
0 references
termination rules
0 references
switching rules
0 references
probabilities of winning
0 references
0.7340361475944519
0 references
0.7252621650695801
0 references