Analytical solutions of N-person games

Research output: Contribution to journalArticle

2 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)54-62
Number of pages9
JournalComplexity
Volume17
Issue number4
DOIs
StatePublished - Jan 1 2012

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • General

Cite this