Böhme, ThomasSchreyer, JensErfurth, ChristianEichler, GeraldSchau, Volkmar2019-02-202019-02-202009978-3-88579-242-9https://dl.gi.de/handle/20.500.12116/20422We 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.enText/Conference Paper1617-5468