-

 

 

 




Optimization Online





 

Chance-constrained games: A mathematical programming approach

Vikas Vikram Singh (vikas.singh***at***lri.fr)
Abdel Lisser (abdel.lisser***at***lri.fr)

Abstract: 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. We show a one-to-one correspondence between a Nash equilibrium of a chance-constrained game corresponding to normal distribution and a global maximum of a certain mathematical program. Further as a special case where the payoffs are independent and identically distributed normal random variables, we show that a strategy pair, where each player’s strategy is a uniform distribution over his action set, is a Nash equilibrium. We show a one-to-one correspondence between a Nash equilibrium of a chance-constrained game corresponding to Cauchy distribution and a global maximum of a certain quadratic program.

Keywords: Chance-constrained game, Nash equilibrium, Normal distribution, Cauchy distribution, Mathematical program, Quadratic program.

Category 1: Stochastic Programming

Category 2: Other Topics (Game Theory )

Citation:

Download: [PDF]

Entry Submitted: 12/31/2015
Entry Accepted: 12/31/2015
Entry Last Modified: 04/07/2017

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society