|
|
 |
| |
|
|
|
A Hybrid Nash Min-Max Approach for Solving Continuous Static Games |
|
|
|
PP: 1035-1045 |
|
|
|
doi:10.18576/amis/140611
|
|
|
|
Author(s) |
|
|
|
Yousria A. Elnaga,
Abdullah S. Shalaby,
Ali S. Shehab,
|
|
|
|
Abstract |
|
|
| This paper addresses a novel structure of continuous static games (CSGs) called hybrid continuous static games (HCSG). These types of games are based on the fact that the game is presented as a hybrid game between multiple players playing independently using Nash equilibrium solutions (NES) and others playing according to a secure concept using Min-Max solutions (MMS). A Nash Min-Max approach was established to solve such genre games. Also, an algorithm for solving Nash Min-Max hybrid continuous static games (NMMHCSG) has been outlined in clear steps. Moreover, a realistic application of four firms selling replaceable products and seeking to maximize their profits was presented to demonstrate the steps of the algorithm.
|
|
|
|
|
|
|
|
