Alternative routs of games with rigid schedule
    
    
  
  
  
      
      
      
        
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika, Tome 10 (2018) no. 3, pp. 30-40
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			Corporative-competitive system, which is inside of corporations, can be determined as a “game”, step-by-step performing a certain type of activity. The system operates in real physical time, and the result of operation is the distance, which is divided into stages. The stages are passed by the team participants due to rigid schedule, which may be occasionally selected from the set of possible schedules. The abstraction “M-parallel semi-Markov process” is used for description of a system under consideration. In semi-Markov process degenerate distribution is used for description of time intervals between relay points. For analysis of relay-race evolution, recurrent method which takes into account rigidity of schedule and stochastic character of route selection is used. In accordance with the concept of distributed forfeit and proposed recurrent procedure, the method of calculation of summing forfeit, which one of competing teams receives from other teams, is proposed.
			
            
            
            
          
        
      
                  
                    
                    
                    
                        
Keywords: 
relay-race, semi-Markov process, degenerate distribution, distributed forfeit, recurrent procedure.
Mots-clés : route, evolution
                    
                  
                
                
                Mots-clés : route, evolution
@article{VYURM_2018_10_3_a3,
     author = {E. V. Larkin and A. N. Privalov},
     title = {Alternative routs of games with rigid schedule},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matematika, mehanika, fizika},
     pages = {30--40},
     publisher = {mathdoc},
     volume = {10},
     number = {3},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VYURM_2018_10_3_a3/}
}
                      
                      
                    TY - JOUR AU - E. V. Larkin AU - A. N. Privalov TI - Alternative routs of games with rigid schedule JO - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika PY - 2018 SP - 30 EP - 40 VL - 10 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VYURM_2018_10_3_a3/ LA - en ID - VYURM_2018_10_3_a3 ER -
%0 Journal Article %A E. V. Larkin %A A. N. Privalov %T Alternative routs of games with rigid schedule %J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika %D 2018 %P 30-40 %V 10 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/item/VYURM_2018_10_3_a3/ %G en %F VYURM_2018_10_3_a3
E. V. Larkin; A. N. Privalov. Alternative routs of games with rigid schedule. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika, Tome 10 (2018) no. 3, pp. 30-40. http://geodesic.mathdoc.fr/item/VYURM_2018_10_3_a3/
