Using Path Induction to Evaluate Sequential Allocation Procedures
| Autor: | Quentin F. Stout, Janis Hardwick |
|---|---|
| Rok vydání: | 1999 |
| Předmět: | |
| Zdroj: | SIAM Journal on Scientific Computing. 21:67-87 |
| ISSN: | 1095-7197 1064-8275 |
| DOI: | 10.1137/s1064827595291820 |
| Popis: | Path induction is a technique used to speed the process of making multiple exact evaluations of a sequential allocation procedure, where the options are discrete and their outcomes follow a discrete distribution. Multiple evaluations are needed for determining criteria such as maxima or minima over parameter regions (where the location of the extremal value is unknown in advance), for visualizing characteristics such as robustness, or for obtaining the distribution of a statistic rather than just its mean. By using an initial phase to determine the number of paths reaching each terminal state, the subsequent evaluations are far faster than repeated use of standard evaluation techniques. Algorithms are given for fully sequential and staged sequential procedures, and the procedures can be either deterministic or random. The procedures can be generated by any technique (including dynamic programming or ad hoc approaches), and the evaluations performed can be quite flexible and need not be related to the method of obtaining the procedure. While the emphasis is on path induction, the techniques used to speed up the analyses of staged allocation procedures can also be used to improve backward induction for such procedures. If multiple evaluations need to be carried out, however, path induction will still be far superior. For each parameter configuration to be evaluated, one reduces the time by a factor of n, where n is the size of the experiment, by using path induction rather than the standard technique of backward induction. In some settings the savings is significantly greater than n. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|