This paper shows that there exists a Nash equilibrium of an n-player chance-constrained game for elliptically symmetric distributions. For a certain class of payoff functions, we suitably construct an equivalent mathematical program whose global maximizer is a Nash equilibrium. ArticleDownload View PDF
We consider an n-player non-cooperative game where each player has expected value payoff function and her strategy set is defined by a joint chance constraint. The random constraint vectors are independent. We propose a subset of probability distributions from elliptical family of distributions. We consider the case when the probability distribution of each random constraint … Read more
This paper studies an n-player non-cooperative game with strategy sets defined by stochastic linear constraints. The stochastic constraints of each player are jointly satisfied with a probability exceeding a given threshold. We consider the case where the row vectors defining the constraints are independent random vectors whose probability distributions are not completely known and belong … Read more
We consider a two player bimatrix game where the entries of the payoff matrices are random variables. We formulate this problem as a chance-constrained game by considering that the payoff of each player is defined using a chance constraint. We consider the case where the entries of the payoff matrices are independent normal/Cauchy random variables. … Read more
We consider an n-player strategic game with finite action sets. The payoffs of each player are random variables. We assume that each player uses a satisficing payoff criterion defined by a chance-constraint, i.e., players face a chance- constrained game. We consider the cases where payoffs follow normal and elliptically symmetric distributions. For both cases we … Read more