Geodesic
Fast strategies in Waiter-Client games
Dennis Clemens1 ; Pranshu Gupta1 ; Fabian Hamann1 ; Alexander Haupt1 ; Mirjana Mikalački2 ; Yannick Mogge1
1Hamburg University of Technology
2University of Novi Sad
The electronic journal of combinatorics, Tome 27 (2020) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Waiter-Client games are played on some hypergraph $(X,\mathcal{F})$, where $\mathcal{F}$ denotes the family of winning sets. For some bias $b$, during each round of such a game Waiter offers to Client $b+1$ elements of $X$, of which Client claims one for himself while the rest go to Waiter. Proceeding like this Waiter wins the game if she forces Client to claim all the elements of any winning set from $\mathcal{F}$. In this paper we study fast strategies for several Waiter-Client games played on the edge set of the complete graph, i.e. $X=E(K_n)$, in which the winning sets are perfect matchings, Hamilton cycles, pancyclic graphs, fixed spanning trees or factors of a given graph.
DOI : 10.37236/9451
Classification : 05C57, 05C65, 05C40, 05C05, 05C45, 91A43, 91A24
Mots-clés : strong games, perfect matching game

Dennis Clemens  1   ; Pranshu Gupta  1   ; Fabian Hamann  1   ; Alexander Haupt  1   ; Mirjana Mikalački  2   ; Yannick Mogge  1

1 Hamburg University of Technology
2 University of Novi Sad 
@article{10_37236_9451,
     author = {Dennis Clemens and Pranshu Gupta and Fabian Hamann and Alexander Haupt and Mirjana Mikala\v{c}ki and Yannick Mogge},
     title = {Fast strategies in {Waiter-Client} games},
     journal = {The electronic journal of combinatorics},
     year = {2020},
     volume = {27},
     number = {3},
     doi = {10.37236/9451},
     zbl = {1448.05141},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9451/}
}
TY  - JOUR
AU  - Dennis Clemens
AU  - Pranshu Gupta
AU  - Fabian Hamann
AU  - Alexander Haupt
AU  - Mirjana Mikalački
AU  - Yannick Mogge
TI  - Fast strategies in Waiter-Client games
JO  - The electronic journal of combinatorics
PY  - 2020
VL  - 27
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9451/
DO  - 10.37236/9451
ID  - 10_37236_9451
ER  - 
%0 Journal Article
%A Dennis Clemens
%A Pranshu Gupta
%A Fabian Hamann
%A Alexander Haupt
%A Mirjana Mikalački
%A Yannick Mogge
%T Fast strategies in Waiter-Client games
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/9451/
%R 10.37236/9451
%F 10_37236_9451
Dennis Clemens; Pranshu Gupta; Fabian Hamann; Alexander Haupt; Mirjana Mikalački; Yannick Mogge. Fast strategies in Waiter-Client games. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/9451

Cité par Sources :