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...

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>