| Article ID: | iaor19992885 |
| Country: | United States |
| Volume: | 13 |
| Issue: | 1 |
| Start Page Number: | 75 |
| End Page Number: | 93 |
| Publication Date: | Jan 1999 |
| Journal: | Probability in the Engineering and Informational Sciences |
| Authors: | Chong K.S. |
The move-to-front rule is applied on a model where several records are accessed each time. The records will then be placed in the front positions randomly or with the former relative order between themselves preserved. Equilibrium distributions are explored. Comparison of expected stationary search costs is carried out.