Logo des Repositoriums
 

A game theoretic approach to graph problems

dc.contributor.authorBöhme, Thomas
dc.contributor.authorSchreyer, Jens
dc.contributor.editorErfurth, Christian
dc.contributor.editorEichler, Gerald
dc.contributor.editorSchau, Volkmar
dc.date.accessioned2019-02-20T10:21:04Z
dc.date.available2019-02-20T10:21:04Z
dc.date.issued2009
dc.description.abstractWe investigate some well known graph theoretic problems from a game theoretic point of view. To coloring and matching problems we associate binary payoff games where the players are the vertices of the graph. Solutions to the graph problems correspond to action profiles of the game, where all players get payoff 1. We show, that there exist rules for the choice of action in the repeated play of these games, that converge to the solution of the graph problems. Although the convergence is slow, this shows, that the problems can be solved with almost no information on the underlying graph.en
dc.identifier.isbn978-3-88579-242-9
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/20422
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartof9th International Conference On Innovative Internet Community Systems I2CS 2020
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-148
dc.titleA game theoretic approach to graph problemsen
dc.typeText/Conference Paper
gi.citation.endPage156
gi.citation.publisherPlaceBonn
gi.citation.startPage149
gi.conference.dateJune 15-17, 2009
gi.conference.locationJena
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
149.pdf
Größe:
101.63 KB
Format:
Adobe Portable Document Format