Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure (Q4254239): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/07474949908836423 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2323205486 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Selecting the highest probability in binomial or multinomial trials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Selecting the highest of three binomial probabilities / rank | |||
Normal rank | |||
Latest revision as of 20:05, 28 May 2024
scientific article; zbMATH DE number 1310125
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure |
scientific article; zbMATH DE number 1310125 |
Statements
Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure (English)
0 references
21 February 2000
0 references
lower bound formula
0 references
expected reward
0 references
sequential elimination
0 references
