Analytical solutions of N‐person games |
| |
| Authors: | Miklos N Szilagyi |
| |
| Institution: | Department of Electrical and Computer Engineering, University of Arizona, Tucson, Arizona 85721 |
| |
| Abstract: | The possibility of analytical solutions of N‐person games is presented. A simple formula provides valuable information about the outcomes of such games with linear payoff functions and Pavlovian agents. Experiments performed with our simulation tool for the multiagent stag hunt dilemma game are presented. For the case of Pavlovian agents the game has nontrivial but remarkably regular solutions. If both payoff functions are linear and the real solutions of Eq. (2) are both positive, then the analytical solutions are remarkably accurate. © 2012 Wiley Periodicals, Inc. Complexity, 2012 |
| |
| Keywords: | agent‐based simulation N‐person games stag hunt dilemma |
|
|
