Discrete Model of Paired Relay-Race

Abstract

The case of the active and passive team relay-race, in which an active team operates in accordance with rigid schedule and a passive team overcome the stage of its distance at randomly selected alternative routs during occasional time intervals is considered. Due to high complexity of classical relay-race analysis, method of simulation, based on representation of time intervals densities of passing stages routs with discrete distributions is proposed. It is shown, that after transformation of time intervals densities into discrete distributions the problem of a relay race analysis reduces to the task of analysis of two-team system with rigid schedules. The method of sampling of densities composition with estimation a sampling error, and recursive procedure of rigid schedule relay-race analysis with calculation of forfeit are worked out. It is shown, that forfeit depends on the difference of stages, teams overcome at current time and a strategy, which active team realizes during relay-race.