Showing 1 - 10 of 21
We consider simple Markovian games, in which several states succeed each other over time, following an exogenous discrete-time Markov chain. In each state, a different simple static game is played by the same set of players. We investigate the approximation of the Shapley–Shubik power index in...
Persistent link: https://www.econbiz.de/10010759865
We consider both discrete-time irreducible Markov chains with circulant transition probability matrix P and continuous-time irreducible Markov processes with circulant transition rate matrix Q. In both cases we provide an expression of all the moments of the mixing time. In the discrete case, we...
Persistent link: https://www.econbiz.de/10011039807
Persistent link: https://www.econbiz.de/10009821618
Persistent link: https://www.econbiz.de/10010072033
Persistent link: https://www.econbiz.de/10009503756
Persistent link: https://www.econbiz.de/10010416240
Persistent link: https://www.econbiz.de/10009708124
We consider a zero-sum stochastic game with side constraints for both players with a special structure. There are two independent controlled Markov chains, one for each player. The transition probabilities of the chain associated with a player as well as the related side constraints depend only...
Persistent link: https://www.econbiz.de/10010847893
We consider a zero-sum stochastic game with side constraints for both players with a special structure. There are two independent controlled Markov chains, one for each player. The transition probabilities of the chain associated with a player as well as the related side constraints depend only...
Persistent link: https://www.econbiz.de/10010950277
We consider a finite buffer capacity GI/GI/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$c$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>c</mi> </math> </EquationSource> </InlineEquation> identical servers and can accommodate up to <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$K$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>K</mi> </math> </EquationSource> </InlineEquation> jobs (including <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$c$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>c</mi> </math> </EquationSource> </InlineEquation> jobs...</equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010999718