In this paper, we consider discrete-time <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$N$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>N</mi> </math> </EquationSource> </InlineEquation>-person constrained stochastic games with discounted cost criteria. The state space is denumerable and the action space is a Borel set, while the cost functions are admitted to be unbounded from below and above. Under suitable conditions...</equationsource></equationsource></inlineequation>