Please use this identifier to cite or link to this item:
https://doi.org/10.15480/882.3034
Publisher DOI: | 10.37236/9451 | arXiv ID: | 2003.09247v3 | Title: | Fast strategies in waiter-client games | Language: | English | Authors: | Clemens, Dennis ![]() Gupta, Pranshu Hamann, Fabian ![]() Haupt, Alexander ![]() MikalaĨki, Mirjana Mogge, Yannick |
Keywords: | Mathematics - Combinatorics; Mathematics - Combinatorics; 05C57, 05C40, 05C05, 05C45 | Issue Date: | 18-Sep-2020 | Publisher: | EMIS ELibEMS | Source: | Electronic Journal of Combinatorics 3 (27): P3.57, 1-35 (2020) | Abstract (english): | Waiter-Client games are played on some hypergraph (X,𝓕), where 𝓕 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 𝓕. 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(Kn), in which the winning sets are perfect matchings, Hamilton cycles, pancyclic graphs, fixed spanning trees or factors of a given graph. |
URI: | http://hdl.handle.net/11420/7720 | DOI: | 10.15480/882.3034 | ISSN: | 1077-8926 | Journal: | The electronic journal of combinatorics | Institute: | Mathematik E-10 | Document Type: | Article | License: | ![]() |
Appears in Collections: | Publications with fulltext |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
9451-PDF file-33488-1-10-20200910.pdf | Verlags-PDF | 435,08 kB | Adobe PDF | View/Open![]() |
Page view(s)
227
Last Week
0
0
Last month
4
4
checked on Feb 3, 2023
Download(s)
85
checked on Feb 3, 2023
SCOPUSTM
Citations
1
Last Week
0
0
Last month
0
0
checked on Jun 30, 2022
Google ScholarTM
Check
Note about this record
Cite this record
Export
This item is licensed under a Creative Commons License