License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2019.3
URN: urn:nbn:de:0030-drops-113616
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11361/
Go to the corresponding LIPIcs Volume Portal


Bouyer, Patricia

On the Computation of Nash Equilibria in Games on Graphs (Invited Talk)

pdf-format:
LIPIcs-TIME-2019-3.pdf (0.4 MB)


Abstract

In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games played on graphs. I will present in particular a construction, called the suspect game construction, which allows to reduce the computation of Nash equilibria to the computation of winning strategies in a two-player zero-sum game.

BibTeX - Entry

@InProceedings{bouyer:LIPIcs:2019:11361,
  author =	{Patricia Bouyer},
  title =	{{On the Computation of Nash Equilibria in Games on Graphs (Invited Talk)}},
  booktitle =	{26th International Symposium on Temporal Representation and Reasoning (TIME 2019)},
  pages =	{3:1--3:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-127-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{147},
  editor =	{Johann Gamper and Sophie Pinchinat and Guido Sciavicco},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11361},
  URN =		{urn:nbn:de:0030-drops-113616},
  doi =		{10.4230/LIPIcs.TIME.2019.3},
  annote =	{Keywords: Multiplayer games, Nash equilibria}
}

Keywords: Multiplayer games, Nash equilibria
Collection: 26th International Symposium on Temporal Representation and Reasoning (TIME 2019)
Issue Date: 2019
Date of publication: 07.10.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI