License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2019.35
URN: urn:nbn:de:0030-drops-115978
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11597/
Go to the corresponding LIPIcs Volume Portal


Brihaye, Thomas ; Geeraerts, Gilles ; Hallet, Marion ; Monmege, Benjamin ; Quoitin, Bruno

Dynamics on Games: Simulation-Based Techniques and Applications to Routing

pdf-format:
LIPIcs-FSTTCS-2019-35.pdf (0.5 MB)


Abstract

We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly update their respective strategies (for instance, to improve the outcome w.r.t. the current strategy profile). This generates a dynamics in the game which may eventually stabilise to an equilibrium. The objective of the present paper is twofold. First, we aim at drawing a general framework to reason about the termination of such dynamics. In particular, we identify preorders on games (inspired from the classical notion of simulation between transitions systems, and from the notion of graph minor) which preserve termination of dynamics. Second, we show the applicability of the previously developed framework to interdomain routing problems.

BibTeX - Entry

@InProceedings{brihaye_et_al:LIPIcs:2019:11597,
  author =	{Thomas Brihaye and Gilles Geeraerts and Marion Hallet and Benjamin Monmege and Bruno Quoitin},
  title =	{{Dynamics on Games: Simulation-Based Techniques and Applications to Routing}},
  booktitle =	{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
  pages =	{35:1--35:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-131-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{150},
  editor =	{Arkadev Chattopadhyay and Paul Gastin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11597},
  URN =		{urn:nbn:de:0030-drops-115978},
  doi =		{10.4230/LIPIcs.FSTTCS.2019.35},
  annote =	{Keywords: games on graphs, dynamics, simulation, network}
}

Keywords: games on graphs, dynamics, simulation, network
Seminar: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Issue Date: 2019
Date of publication: 10.12.2019


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