Analytical solutions of N-person games

Miklos N. Szilagyi

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)54-62
Number of pages9
Issue number4
StatePublished - 2012
Externally publishedYes


  • Agent-based simulation
  • N-person games
  • Stag hunt dilemma

ASJC Scopus subject areas

  • General


Dive into the research topics of 'Analytical solutions of N-person games'. Together they form a unique fingerprint.

Cite this