Alternative routs of Games with rigid schedule Текст научной статьи по специальности «Математика»

DOI: 10.14529/mmph180304

ALTERNATIVE ROUTS OF GAMES WITH RIGID SCHEDULE

E.V. Larkin1, A.N. Privalov2

1 Tula State University, Tula, Russian Federation

2 Tula State Lev Tolstoy Pedagogical University, Tula, Russian Federation E-mail: privalov.61@mail.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; route; evolution; distributed forfeit; recurrent procedure.

Introduction

Relay-races, as the basic conception of corporative-concurrent system description, may be applied to modeling of such fields of human activity, as industry, economics, politics, defense, sport, etc [1-4]. Due to conception announced teams, participating in relay-race, should to pass the distance, which is divided onto stages by relay-points, and team participants should to pass the stage in real physical time. Common case of random time relay-race simulation was considered in [2, 5], where for description of teams behavior such abstraction, as semi-Markov process was used. Semi-Markov process is quite universal mathematical apparatus, and when instead of random time emerges rigid schedule, it can be used too. Rigidity of stage passing time permit substantially simplify model of the system and calculation of forfeit, but also leads to substantial restrictions of results obtained.

On practice teams, participated the relay race, may vary their schedules, and for an external observer such variations are the stochastic ones. This permits to consider different combinations of schedules and to improve results obtained. Approaches to modeling of relay-races with rigid schedules and alternative routes are currently known insufficiently, that explains necessity and relevance of the investigations in this domain.

1. Relay-race as M-parallel semi-Markov process

The graph, which shows the alternative routes rigid schedule relay-race structure, is shown on the fig. 1.

Following assumptions, when modeling this kind of races, are made bellow [5]:

in relay-race participate M-teams, every of which pass its distance in real physical time;

distance of every team is divided onto stages, every of which is overcame by one participant of a team, and first participants of all teams start their stages at once;

every participant may choose a route, for passing the stage, for an external observer the route selection is a random event;

passing the stage route by participant lasts rigid time, which is individual for the team, the stage and the route;

after completion of a current stage on the selected route next participant of the team selects route and starts the passing next stage without a lag;

forfeit, which is imposed on the teams is defined as the distributed payment, value of which depends on the time and difference of stages, which currently teams pass.

s

S:

Team 1 Team m Team M

Fig. 1. Structure of alternative routes rigid schedule relay-race

The model of relay-race with M teams may be performed as M-parallel semi-Markov process [6-8]:

m=jmi,-, mmm (t)} , (1)

mm =j Am ,hm (t)} ,

where t is the physical time; mm is the ordinary semi-Markov process, Am is the set of states; hm (t) is the semi-Markov matrix, which describes an activity of the m-th team;

A

4

0(m) : ai(m) :•••: aj(m) :•••: aj (m) I

1.

hm (t) =

h

j(m):l(m)

(t )

h

j(m):l(m)

(t ) =

hm (t) = \Lhj( m),l( m) (t )J , 1 £ j ( « ), l ( m)£ J ;

K (m, j)

Z hk(m,j) (t), when l(m) = j(m) +1, 0 < j(m) £ J(m) -1;

k (m, j )=1

0 in all other cases.

(2)

(3)

(4)

(5)

Due to rigid schedule and quasi-stochastic principle of route selection [9]

t - T,

k (m, j)

(6)

hk(m,j) (t) - Pk(m,j) fk(m,j) (t) - Pk(m,j)d

where pk(m j) is the probability of route selection; fk(m j) (t) is the pure time density of residence the process at the state aj(m) with further switch to the state ajm)+1 on the k-th route; d(t -Tk(m j)) is the Dirac d-function; Tk(m j) is the rigid time of passing the j-th stage by participant of team m with k(m, j) -th route.

Comparison of classic competition [2] and competition with rigid schedule is shown on the fig. 2;

f

Vk (m, j )(t) fk (m, j )(t) f

f f

Tk

k(m,j)

f J TKnO t■

T

l(n,i)

1A

Tk

k(m,j) t

Tk

k(m,j)

i

Tl

l(n i)

b

Fig. 2. Classic competition (a) and competition with rigid schedules (b)

When classic competition, times of semi-Markov process residence in states a^m) and a(n) are equal to fk(mj)(t) and fi^ni)(t), correspondingly. When rigid schedule times are equal to

d

t - T

k(m, j)

and d

t - T

l( n,i).

. Formulae, which describe weighted time density and probabilities of

winning the j-th stage of race by m-th team, if all participating teams start their stages simultaneously, are as follows:

M

Г«*, j )(t ) = fk (m, j)( t )П 1 - %,i)(t)

n=1 n^m

m,j)= ¡^m,j)(t)dt ; 0

¥Wk{m j) (t) = d - Tk{ m,J) ), When Tk{ m,j) = т1П lTl(l,i) ,"•, Tk (m>J),

[nonsense, otherwise,

,T

l( M ,i)

p

k( m, j)

1 when Tk(m,j) = min{Tl(l,i), •••, Tk(m,j), •••, Tl(M,i)} ,

I 0, otherwise,

(7)

(8) (9)

(10)

where F (t)- jf (0)dO is the distribution function; qis the auxiliary argument.

0

Pure time density of winning the j-th stage of race by m-th team is as follows:

yW(m, j )(t)

j m, j )(t )="

(11)

P

k(m, j)

When paired competition, formulae, which describe the time density of waiting by m-th, winner, team until n-th, loser, team, finishes the stage, are as follows:

t

a

h(t ) J fk{ m, j )(q)-f щ )(t + û) dÛ jk(m,J)®l(n,i) (') =--; (12)

J F (m, J )(t ) dFl( n,i )(t )

jk(m,j)®l(n,i) (t) -

where h(t) is the Heaviside function;

nonsense, otherwise.

t Tl(n,i ) + Tk (m, J )

when Tu л £ T, л ;

k(m,j) l(n,i) '

(13)

. . f0, when t < 0; h(t)-1

11, otherwise.

It is necessary to admit, that in the case under consideration, unlike the case considered at [2], the draw effect emerges. It is caused with the infinitesimal probability of two or more teams stage passing times coincidence when time intervals are a random ones, and quite real rigid schedule case, when some time intervals are quite the same (the case is shown on the fig. 2, b, bottom line).

Due to the fact, that for all teams, participated in a race, number of the stage j at every relay point may to increment only, for external viewer sequence of switches during relays in the system as a whole has the nature of evolution [10-13], which develops from functional state, being defined with vector

[14] (a0(!),..., a0(m),..., a0(M)) till functional state (aj ^,..., aj (m),..., aj (M)). Trajectory of evolution

depends of routes, which every team select for passing of proper stages and schedules which develop from routes selected. Owing to random character of routes selection trajectory of evolution is the random one. Common number of routes, on which m-th team as a whole may overcome the distance is equal to

K (m) — JK (m, j), (14)

j -1

where K (m, j) is the common number of routs of m-th team j-th stage. Common number of different variants of rigid relay-races is as follows:

M

K = nK(m). (15)

m—1

2. Recursive procedure of relay-race evolution analysis

Let us select from all possible routes on which m-th team may overcome the distance the k(m) -th

variant, in which routes k(m,1), ..., k(m, j), ..., k(m, J) are selected (note, that in common case

k(m,1)^ .. ^ k(m, j.. ^ k(m, J), since these are different functions of m and j). So 1 (m) -th and K(m) -th variants correspond to combinations 1(m,1), ..., 1(m, j), ..., 1(m, J) and K(m,1), ..., K (m, j), ..., K (m, J) respectively. Such a selection should be executed on routes of all other teams.

For selected routes the recursive procedure of relay-race evolution may be worked out. For this purpose

auxiliary time 0 should be introduced. Recursive procedure of evolution analysis is as follows.

Initial functional state of the semi-Markov process (1) as a whole is (a0(^,...,a0(m),...,a0(M)),

where elements of vector are numbers of relay-race starting points. All teams start race simultaneously,

and into auxiliary time 0next substitutions should be made:

0O (1)^ ^(1,1) , ..., 0O ( m)^ Tk (m,1) , ..., 0O (M Tk (M ,1) , (16)

where arrow ^ indicates the direction of substitution; index means the quantity of previous switches.

о

Rigid time intervals 0O (1),..., 0O (m),..., 0O (M) compete between them, and result of competition

is winning the stage by those teams, which have minimal value of 0. This values fulfill the subset ©0 :

©0 —{0* (u) ,...,00* (v) ,...,00* (w)] ;

{00* (u),..., 0O* (v),..., 0O* (w)] — min q{00 (1),..., 00 (m),..., 00 (M)]

where u, v, w are auxiliary indices for nomination the number of team. It is obviously, that

00* ^00* (u) —... — 00* (v) —... — 00* (w),

i. e. teams with numbers

(17)

N0 ={arg

(u )"

,...,arg

00 ( v )

... , arg

00 ( w

( W)]}

(18)

(19)

win the competition among other teams, but draw the competition among themselves. Quantity of switches S(1) on the first step of recursion is equal to cardinal number of subset ©0 :

S (1)—©0

Due to the switches, next substitutions should be maid to prepare next step of recursion: index of 00 (m), 1 < m < M , should be replaced with index of s (1)^ 0 + S (1); time intervals, which will compete further should be replaced as follows

00 (m)- 00*, when mg N*;

(20)

0s (1)( m

Tk(m,2),when m e N0;

(21)

indices i(m) of elements of vector (a0(^,..., a0(m),..., a0(M)) should be replaced as follows:

0(m), when mg N*;

l( m)^-

1( m ), when m e N*.

(22)

In such a way on the second step or recursion rigid time intervals 0*^) (1),..., 0*^) (m),..., 0*^) (M)

will compete between them.

Let us assume that on the r-th step of the recursion vector of functional state of semi-Markov proc-

and time intervals 0s(r —1) (1) ,...,0s( r-1)( m) , .,0s(r-1)(M )

ess is (a,.(1) ,,..., a,.(..л ,,..., a.

"j(m"j(M)-1

com-

pete between them. Result of competition is winning the stage by those teams, which have minimal

(23)

■s(r-1) •

value of 0. This values fulfill the subset ©*S

©*( r-1)— {0S(r—1)(u),..., 0S(r—1)(v),..., 0S(r—1)(w)];

0r—1) (u),..., 0*(r—1) (v),..., 0*(r—1) (w)] — min 0{0*(r—1) (1),..., 0*(r—1) (m),..., 0*(1) (M)] . It is obviously, that

0*

( r-1)

^0;

(r-1) 1

(U) = ... = 0*(r-1)(V) = ... = 0*(г-1)(W) ,

(r-1)

i.e. teams with numbers

N

(r-1)

= {arg 0-1) (u)],..., arg [0S(r-1) (V)

.., arg

0*(r-1)( W)

(24)

(25)

win the competition. Quantity of switches on the r-th step of recursion is equal to cardinal number of

subset ©,

(r-1) •

s ( r ) =

Q*

(r-1)

(26)

Due to the switches, following substitutions should be maid to prepare next step of recursion:

Larkin E. V., Alternative Routs of Games with Rigid Schedule Privalov A.N._

index of (m) 1 < m < M , should be replaced with index J(r) ü s (r -1) + J(r); time intervals, which will compete further should be replaced as follows -

qs(r _i)(m) _ q*( r _i), when m * N*(r _i);

*

Tk(m, j+1),when m e Ns(r-1)

qs(r)( m )ü

components of vector (aj(1)_1, •••, m)_1, •••, )_1) should be replaced as follows -

(27)

aj(m)-1 Ü

(28)

aj( m)-i,when m * N*(r-i); aj(m),when m G N,(r-1).

In such a way on the (r+1)-th step or recursion rigid time intervals 0s( r) (1),..., 0s( r) (m),..., 0s(r) (M) compete between them.

Let assume that on the lust but one step of recursion after MJ - 3 switches vector became

(aj(l)aJ(u)-1,..., aj (v)-P ..., aj (m), ..., aJ(w)-1,..., aj(M)) , and rigid time intervals

0MJ-3 (k), 0MJ-3 (l), 0MJ-3 (n) compete between them only. Let us also assume, that minimal values of

0, which fulfill the subset Q*JM -3, are

Q*M-3 ={oJm-3 (u),0*M-3 (w)}; (29)

{oJM-3 (u),..., J-3 (w)} i min 0{OMJ-3 (u), 0MJ-3 (v), 0MJ-3 (w)}.

°MJ-3 ^ 0MJ-3 (u) - °MJ-3 (w), (30)

1. e. teams with numbers u and w win the competition.

Due to (29) and (30) on the last but one step two switches occur, namely u-th and w-th teams reach the final point of race and after that functional state became

(aJ(1),...,aJ(u),...,aJ(v)-1,...,aJ(m), ...,aJ(w),...,aJ(M)), i.e. w-th team on the last step should finish the distance at the time

0MJ-3+2 (l) - 0MJ-3 (l) - 0MJ-3 , (3 1)

and relay race in the state (aJ(1),..., aJ(m), ..., aJ(M)) will over.

3. Schedule effectiveness evaluation recursive procedure

Quite natural for evaluation of rigid schedule effectiveness is the model, in which all possible pairs of teams, f.e. m-th and n-th, and forfeit m) ^ (t), distributed at the time, are considered. Distributed

forfeit, in turn, is defined as payment, which the n-th team pays to the m-th team, namely

> 0, when i (m )> j (n);

si( m), j(n) (t) j=^ when i (m) >j (n); (32)

< 0, when i (m )< j (n),

where 0 £ i (m), j (n )£ J .

For evaluation of common forfeit, which the m-th team receives from the n-th team, one can to use the recursive procedure, described above. At initial two-elements functional state (a0(m), a0(n)) substitutions

q0 (mTk(m,1) , q0 (nTk(n,1) (33)

should be done.

In this simplified two-parallel semi-Markov process only time intervals 00 (m), 00 (n) compete between them. Possible result of competition may be the next:

a) wins the team m, if 00 (m) <00 (n), then ©0-00 (m)} -min{00 (m), 00 (n)} , O^^ (m),

s (1)-1;

b) wins the team n, if 00 (m) >00 (n), then ©0-00 (n)} - min{o0 (n),00 (n)}, 0^ (n),

s (1)-1;

c) competition is draw, if 00 (m) = 00 (n), then ©0-00 (m), O^ (m)} - min {00 (m), 00 (n)},

00 ^ Of) (m) - OOJ (m), s (1)-2.

Value of forfeit is equal as follows:

<s(0) [k ( m1, k ( nA)] - j <0( m),0( n)(t) dt , (34)

0

where insertion indices k (m,1), k (n,1) substitution (33).

Substitutions for preparing next step of recursion are as follows: indices of O0 (m), O0 (n), should be replaced with

s (1)^ 0 + s(1); (35)

f1in the case a), b); s (1)- j (36)

[2 in the case c);

time intervals, which will compete further and components of vector [0 (m), 0 (m)] should be replaced as follows

\Tk{m,2) in the cases a), c);

Os(1)(j

[O0 (m) - O0 in the cases b);

|Tk(n 2) in the cases b), c);

°s(1)( n |Oy) ^ (37)

[O0 (n) - O0 in the cases a);

components of vector (a0(m), a0(n)) should be replaced as follows -

(a1(m), a0(n)) in the case a);

( a0( m), a0( n))^<

(ao(m), a1( n)) in the case b); (38)

(a1(m), a1(n)) in the case c)^

In such a way on the second step or recursion rigid time intervals Os(1) (m), Os(1) (n) will compete between them.

Let us assume that on the r-th step of the recursion vector of functional state of semi-Markov process is (ai(m),aj(n)), and time intervals Os(r-1) (m), Os(r-1) (n) compete between them. Possible result of competition may be the next:

a) wins the team m, if Os( r-1)( m) <Os(r-1)( n), then

-1) = K(r-1) (m)} = min{qs(г-1) (m), qs(г-1) (n )} , q(r-1) ^ qr-1) (m) , s (r ) ^ s (r - 1) +

Larkin E. V., Alternative Routs of Games with Rigid Schedule

Privalov A.N.

b) wins the team n, if 0*( r—1)( m) >0*( r—1)( n), then

r-1) = -1) ( n )} = mln К г -1) ( n ) > q r-1) ( n )} > q\r-X) ^ r-1) ( n ) > s ( r ) ^ s ( r - 1) + 1 ;

c) competition is draw, if 0*( r—1)( m) = 0*( r—1)( n), then

©**(r—1) — {0*(r—1) (m), 0*r—1) (m)] — min {0*(r—1) (m ), 0*(r—1) (n )] , 0r—1) ^ 0**(r—1) (m) — 0*r—1) (m) ,

* ( r * ( r — 1) + 2 .

Value of forfeit is equal as follows:

0(r —1)

s*(r—1) [k (^i ),k (n, j)] — f S(m), j(n)(t)dt . (39)

0

Substitutions for preparing next step of recursion are as follows:

indices of 0*(r—1) (m), 0*(r—1) (n), should be replaced with index of *(r) ^ *(r — 1) + *(r), where

* (r) is defined as (36);

time intervals, which will compete further and components of vector [i (m), j(m)] should be replaced as follows

Tk(m,i+1) in the cases a), c);

0*( r—1)( m)—0**(r—1)inthecase b);

Tk(n,J+1) in the cases b), c);

qs( r)( m

qs(r)(n

qs(r-1) (n)- q*(r-1)in the case а); ( ^

components of vector [i (m), j (n)] should be replaced as follows

(ai(m)+1, aj(n)) in the case a);

(ai(m), aj(n)H

(ai(m), aj(»)+1)in the case b); (41)

(ai(m)+1, aj(n)+1 ) in the case c).

So on the (r+1)-th step or recursion rigid time intervals 0*(r)(m), 0*(r)(n) will compete between them.

Let us assume, that on the last step of recursion only m-th team stays in race, and time, it spend from a previous switch till finishing J)-th stage, obtained on previous stage of recursion, is 0*R—1).

Value of forfeit on the last stage is is equal as follows:

0(R—1)

S*(R—1) [k(m,J — 1),k (n,J)],— f SJ(m)—1,J(„)(t)dt . (42)

0

For evaluation of common forfeit one should to evaluate probability of realization of the k (m) -th

evolution trajectory of team m and k (n) -th evolution trajectory of team n. They are as follows:

J

hw — n pk m), 1( m )£ k (m )£ K (m);

i—1

Pl{n)— Ife(n, j) , 1(n)< k(n)< K(n) . (43)

j—1

Weighted sum of forfeit, which the m-th team receives from m-th team when realized k(m) -th and k (n) -th evolution trajectories is as follows:

R-1

Sk(m),k(n)(m,n) = Pk(m)Pk(n) Z Ss(r-1) [k (m,i),k (n, J )] • (44)

r=0

Common sum of forfeit, which the m-th team receives from the n-th team is as follows:

Common sum of forfeit, which the m-th team receives from the n-th team, when is as follows

K (n) K (m)

s( m,n K Z _ Z sk(m),k(n)(m,n) • (45)

k (m)=1 (m) k (m)=1 (m)

Common sum of forfeit, which the m-th team receives from all other teams, is as follows

M

s(m) = Z s(m,n). (46)

n=1, n^m

It is necessary to admit, that common sum of forfeit, s( m), the m-th team receives from all other teams, rigidly depends of schedules of all participants of races, including the m-th team and probabilities of routes selection. So to change a sum of forfeit s(m) one may both change m-th team schedule, and

probabilities of selection possible routes on the every stage of the distance. This is essential obstacle, from point of view of putting and solving the forfeit optimization task.

Conclusion

Results obtained gives to system engineers and economists rather simple method of evaluation the effectiveness of those or that team management decisions on the basis of opponent teams behavior observation. Method of forfeit calculation proposed, gives a solid forfeit figure, based on the real knowledge of the strategies of opponents and possible changes of opponents plans. This, in turn, permits to use the game theory [15, 16] to work out a managing strategy, for increasing sum of forfeit which team under management receives from other teams, participated in relay race.

Further investigation in this area should be directed to finding common recommendation for scheduling m-th team strategy with optimization sum of forfeit [17].

The research was carried out within the state assignment of the Ministry of Education and Science of Russian Federation (No 2.3121.2017/PCH).

References

1. Bellman R.E. Dynamic Programming. N.Y.: Dover Publications, Inc, 2003, 384 p.

2. Ivutin A.N., Larkin E.V. Simulation of Concurrent Games. Bulletin of the South Ural State University. Series: Mathematical Modelling, Programming and Computer Software, 2015, Vol. 8, no. 2, pp. 43-54. DOI: 10.14529/mmp150204

3. Larkin E.V., Bogomolov A.V., Privalov A.N. A method for estimating the time intervals between transactions in speech-compression algorithms. Automatic documentation and mathematical linguistics, 2017, Vol. 51, Issue 5, pp. 214-219. DOI: 10.3103/S000510551705003X

4. Ivutin A.N., Larkin E.V., Kotov V.V. Established Routine of Swarm Monitoring Systems Functioning. Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science, vol. 9141, Springer, Cham, 2015, pp. 415-422. DOI: 10.1007/978-3-319-20472-7_45

5. Ivutin A.N., Larkin E.V., Lutskov Yu.I. Simulation of Concurrent Games in Distributed Systems. Proc. 5th International Workshop on Computer Science and Engineering (WCSE 2015), Moscow, Russia, April 15-17, 2015, pp. 60-65.

6. Korolyuk V., Swishchuk A. Semi-Markov random evolutions. Semi-Markov Random Evolutions. Mathematics and Its Applications. Vol 308, Springer, Dordrecht, 1995, pp. 59-91. DOI: 10.1007/978-94-011-1010-5_4

7. Larkin E.V., Lutskov Yu.I., Ivutin A.N., Novikov A.S. Simulation of concurrent process with Petri-Markov nets. Life Science Journal, 2014, Vol. 11, no. 11, pp. 506-511. DOI: 10.7537/marslsj 111114.86

8. Larkin E., Bogomolov A., Privalov A. Data buffering in information-measuring system. Proc. 2nd International Ural Conference on Mea*urement* (UralCon), Chelyabinsk, 2017, pp. 118-123. DOI: 10.1109/URALC0N.2017.8120697

9. Shiryaev A.N. Probability. Springer, New York, NY, 1996, 623 p. DOI: 10.1007/978-1-47572539-1

10. Cleaveland R., Smolka S. Strategic directions in concurrency research. ACM Computing Survey* (CSUR), 1996, Vol. 28, Issue 4, pp. 607-625. DOI: 10.1145/242223.242252

11. Heymann M. Concurrency and Discrete Event Control. IEEE Control Sy*tem* Magazine, 1990, Vol. 10, Issue 4, pp. 103-112. DOI: 10.1109/37.56284

12. Valk R. Concurrency in Communicating Object Petri Nets. Concurrent Object-Oriented Programming and Petri Net*. Lecture Note* in Computer Science, vol. 2001, Springer, Berlin, Heidelberg, 2001, pp. 164-195. DOI: 10.1007/3-540-45397-0_5

13. Dijkstra E.W. Cooperating sequential processes. Programming Language*, Academic Press, London, 1968, pp. 43-112.

14. Larkin E.V., Ivutin A.N. "Concurrency" in M-L-Parallel Semi-Markov Process. MATEC Web of Conference*, 2017, Vol. 108, Article no. 05003. DOI: 10.1051/matecconf/201710805003

15. Myerson R.B. Game theory. Cambridge, London: Harvard University Press, 1997, 568 p.

16. Chatterjee K., Jurdzinski M., Henzinger T. Simple stochastic parity games. Computer Science Logic. CSL 2003. Lecture Note* in Computer Science, 2003, Vol. 2803, pp. 100-113. DOI: 10.1007/978-3-540-45220-1_11

17. Squillante M.S. Stochastic Analysis and optimization of multiserver systems. Run-time Model* for Self-managing Sy*tem* and Application*. Autonomic Sy*tem*. Springer, Basel, 2010, pp. 1-25. DOI: 10.1007/978-3-0346-0433-8_1

Received May 30, 2018

Bulletin of the South Ural State University Series "Mathematics. Mechanics. Physics" _2018, vol. 10, no. 3, pp. 30-40

УДК 519.2 DOI: 10.14529/mmph180304

АЛЬТЕРНАТИВНЫЕ МАРШРУТЫ ИГР С ЖЁСТКИМ РАСПИСАНИЕМ

1 2 Е.В. Ларкин , А.Н. Привалов

1 Тульский государственный университет, г. Тула, Российская Федерация

2 Тульский государственный педагогический университет им. Л.Н. Толстого, г. Тула, Российская Федерация

E-mail: privalov.61@mail.ru

Корпоративно-конкурирующая система, которая присутствует внутри корпораций, может быть определена как «игра», шаг за шагом реализующая определённую деятельность. Система функционирует в реальном физическом времени, а результат операции - это «дистанция», которая делится на «этапы». Этапы проходят участники команд в соответствии с «жестким графиком», который может быть выбран из набора возможных графиков. Абстракция «M-параллельный полумарковский процесс» может быть использована для описания рассматриваемой системы. В полумарковском процессе вырожденное распределение используется для описания временных интервалов между промежуточными точками эстафеты. Для анализа развития эстафеты используется рекуррентный метод, учитывающий жесткость графика и стохастический характер выбора маршрута. В соответствии с предложенной концепцией распределенной «неустойки» и предлагаемой рекуррентной процедуры предлагается метод расчета суммирующей «неустойки», которую получает одна из конкурирующих команд от других команд.

Ключевые слова: эстафета; полумарковский процесс; вырожденное распределение; маршрут; эволюция; распределенная неустойка; рекуррентная процедура.

Литература

1. Bellman, R.E. Dynamic Programming / R.E. Bellman. - N.Y: Dover Publications, Inc. - 2003. -384 p.

2. Ivutin, A.N. Simulation of Concurrent Games / A.N. Ivutin, E.V. Larkin // Вестник ЮУрГУ. Серия «Математическое моделирование и программирование». - 2015. - Т. 8, № 2. - С. 43-54.

3. Larkin, E.V. A method for estimating the time intervals between transactions in speechcompression algorithms / E.V. Larkin, A.V. Bogomolov, A.N. Privalov // Automatic documentation and mathematical linguistics. - 2017. - Vol. 51, Issue 5. - P. 214-219.

4. Ivutin, A.N. Established Routine of Swarm Monitoring Systems Functioning / A.N. Ivutin, E.V. Larkin, V.V. Kotov // Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science, Vol. 9141: сб. науч. тр. - Springer, Cham, 2015. - P. 415-422.

5. Ivutin, A.N. Simulation of Concurrent Games in Distributed Systems / A.N. Ivutin, E.V. Larkin, Yu.I. Lutskov // The 5th International Workshop on Computer Science and Engineering (WCSE 2015). - Moscow, Russia, April 15-17, 2015. - P. 60-65.

6. Korolyuk, V. Semi-Markov random evolutions / V. Korolyuk, A. Swishchuk. - Semi-Markov Random Evolutions. Mathematics and Its Applications. Vol 308: сб. науч. тр. - Springer, Dordrecht, 1995. - P. 59-91.

7. Simulation of concurrent process with Petri-Markov nets / E.V. Larkin, Yu.I. Lutskov, A.N. Ivutin, A.S. Novikov // Life Science Journal. - 2014. - Vol. 11, no. 11. - P. 506-511.

8. Larkin, E. Data buffering in information-measuring system / E. Larkin, A. Bogomolov, A. Privalov // 2-nd International Ural conference on measurements (UralCon). - Chelyabinsk, 2017. -P.118-123.

9. Shiryaev, A.N. Probability / A.N. Shiryaev. - Springer, New York, NY, 1996. - 623 p.

10. Cleaveland, R. Strategic directions in concurrency research / R. Cleaveland, S. Smolka // ACM Computing Surveys (CSUR). - 1996. - Vol. 28. - Issue 4. - P. 607-625.

11. Heymann, M. Concurrency and Discrete Event Control / M. Heymann // IEEE Control Systems Magazine. - 1990. - Vol. 10. - Issue 4. - P. 103-112.

12. Valk, R. Concurrency in Communicating Object Petri Nets / R. Valk. - Concurrent Object-Oriented Programming and Petri Nets. Lecture Notes in Computer Science, vol. 2001: сб. науч. тр. -Springer, Berlin, Heidelberg, 2001. - P. 164-195.

13. Dijkstra, E.W. Cooperating sequential processes / E.W. Dijkstra // Programming Languages: сб. науч. тр. - Academic Press, London, 1968. - P. 43-112.

14. Larkin, E.V. "Concurrency" in M-L-Parallel Semi-Markov Process / E.V. Larkin, A.N. Ivutin // MATEC Web Conf. - 2017. - Vol. 108. - Article no. 05003.

15. Myerson, R.B. Game theory: analysis of conflict / R.B. Myerson. - Cambridge, London: Harvard University Press, 1997. - 568 p.

16. Chatterjee, K. Simple stochastic parity games / K. Chatterjee, M. Jurdzinski, T. Henzinger // Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol. 2803: сб. науч. тр. -Springer, Berlin, Heidelberg, 2003. - P. 100-113.

17. Squillante, M.S. Stochastic Analysis and optimization of multiserver systems / M.S. Squillante // Run-time Models for Self-managing Systems and Applications. Autonomic Systems. - Springer, Basel, 2010. - P. 1-25.

Поступила в редакцию 30 мая 2018 г.