dynOAB: Dynamic programming of the optimal One-Armed Bandits

Description Usage Arguments Value Author(s) See Also Examples

View source: R/dynOAB.R

Description

Dynamic programming of the optimal One-Armed Bernoulli Bandits process

Usage

1
dynOAB(N, al)

Arguments

N

number of trials.

al

the known probability of reward on arm A.

Value

For dynOAB the matrix of maximal predicted rewards. For dynOAB2 the optimal predicted reward.

Author(s)

Shelemyahu Zacks

See Also

simOAB

Examples

1
2
dynOAB(10, 0.5)
dynOAB2(10, 0.5)

mistat documentation built on April 18, 2021, 5:07 p.m.