Analytical solutions of N-person games

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 - Mar 2012

Fingerprint

Experiments

Keywords

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

ASJC Scopus subject areas

  • General

Cite this

Analytical solutions of N-person games. / Szilagyi, Miklos N.

In: Complexity, Vol. 17, No. 4, 03.2012, p. 54-62.

Research output: Contribution to journalArticle

Szilagyi, Miklos N. / Analytical solutions of N-person games. In: Complexity. 2012 ; Vol. 17, No. 4. pp. 54-62.
@article{5743a733c5c0482fb1b109acaf41192d,
title = "Analytical solutions of N-person games",
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.",
keywords = "Agent-based simulation, N-person games, Stag hunt dilemma",
author = "Szilagyi, {Miklos N}",
year = "2012",
month = "3",
doi = "10.1002/cplx.21385",
language = "English (US)",
volume = "17",
pages = "54--62",
journal = "Complexity",
issn = "1076-2787",
publisher = "John Wiley and Sons Inc.",
number = "4",

}

TY - JOUR

T1 - Analytical solutions of N-person games

AU - Szilagyi, Miklos N

PY - 2012/3

Y1 - 2012/3

N2 - 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.

AB - 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.

KW - Agent-based simulation

KW - N-person games

KW - Stag hunt dilemma

UR - http://www.scopus.com/inward/record.url?scp=84858437632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858437632&partnerID=8YFLogxK

U2 - 10.1002/cplx.21385

DO - 10.1002/cplx.21385

M3 - Article

AN - SCOPUS:84858437632

VL - 17

SP - 54

EP - 62

JO - Complexity

JF - Complexity

SN - 1076-2787

IS - 4

ER -