Jeux à objectif compétitif sur les graphes

Abstract : In this thesis, we study three competitive optimization graph games. These games allow a dynamic approach to discrete optimization problems, which is an advantageous alternative way to consider these questions. The global idea consists in defining a combinatorial partisan game, associated to the original optimization problem, like coloring, domination, etc. Two players alternatively build the structure related to the optimization problem. One of them tries to obtain a structure as optimal as possible, whereas his opponent wants to prevent him from doing it. Under the hypothesis that both players play optimally, the size of the obtained structure defines a game invariant of the graph.We start by studying a 1-improper variation of the coloring game, which is the first and the most studied competitive optimization graph game. In this game, the players colors the vertices of a graph, such that two adjacent vertices do not share the same color. In the 1-improper version, we allow a vertex to have at most one neighbor with the same color as it. Then, we study the domination game, in which the players have to build a domination set, that is a sub-set of vertices such that any other vertex is adjacent to one of the vertex in this set. Finally, we define a new game, related to the distinguishing coloring problem. This game is about building a vertex-coloring which is preserved by none of the graph automorphisms. We raise some challenging open questions about this new game, especially concerning the characterization of graphs with infinite game invariant, by the existence of order two automorphisms.
Document type :
Theses
Complete list of metadatas

Cited literature [86 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01681222
Contributor : Abes Star <>
Submitted on : Friday, January 12, 2018 - 3:00:06 PM
Last modification on : Wednesday, April 3, 2019 - 1:55:43 AM

File

SCHMIDT_2016_diffusion.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01681222, version 2

Collections

Citation

Simon Schmidt. Jeux à objectif compétitif sur les graphes. Arithmétique des ordinateurs. Université Grenoble Alpes, 2016. Français. ⟨NNT : 2016GREAM085⟩. ⟨tel-01681222v2⟩

Share

Metrics

Record views

159

Files downloads

356