On two combination rules for 0-1-sequences

MaRDI QIDQ1815270zbMATH OpenFDO

Authors Wolfgang Stadje

Publication date 2 December 1996

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119079

zbMATH Keywords

0-1-sequenceprobabilities of winningseries of win-or-lose gamesswitching rulestermination rules

Mathematics Subject Classification ID

Linear programming (90C05) Multistage and repeated games (91A20) Probabilistic games; gambling (91A60)

Review text

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.

Recommendations

• Sequential games
• scientific article; zbMATH DE number 4139477
• More on n-point, win-by-k games
• n-point, win-by-k games
• scientific article; zbMATH DE number 3936976

Cited in

(2)

• Sequential games
• When copycats lose

This page was built for publication: On two combination rules for 0-1-sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815270)