Revision as of 10:56, 26 July 2019 edit Kai3IIII (talk \| contribs) 70 edits →Variations ← Previous edit		Revision as of 11:00, 26 July 2019 edit undo Kai3IIII (talk \| contribs) 70 edits →Variations Next edit →
Line 65: == Variations == {{harvnb\|Bruss\|Paindaveine\|2000}} discussed a problem of selecting the last <math> k </math> successes. {{harvnb\|Tamaki\|2010}} proved a multiplicative odds theorem which deals with a problem of stopping at any of the last <math> k\ell </math> successes. The tight lower bound of win probability is obtained by. {{harvnb\|Matsui\|Ano\|2017}} discussed a problem of selecting <math>k </math> out of the last <math> \ell </math> successes. '''multiple choice problem''':

Odds algorithm: Difference between revisions