Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.3034
DC FieldValueLanguage
dc.contributor.authorClemens, Dennis-
dc.contributor.authorGupta, Pranshu-
dc.contributor.authorHamann, Fabian-
dc.contributor.authorHaupt, Alexander-
dc.contributor.authorMikalaĨki, Mirjana-
dc.contributor.authorMogge, Yannick-
dc.date.accessioned2020-11-03T08:48:47Z-
dc.date.available2020-11-03T08:48:47Z-
dc.date.issued2020-09-18-
dc.identifier.citationElectronic Journal of Combinatorics 3 (27): P3.57, 1-35 (2020)de_DE
dc.identifier.issn1077-8926de_DE
dc.identifier.urihttp://hdl.handle.net/11420/7720-
dc.description.abstractWaiter-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.en
dc.language.isoende_DE
dc.publisherEMIS ELibEMSde_DE
dc.relation.ispartofThe electronic journal of combinatoricsde_DE
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/de_DE
dc.subjectMathematics - Combinatoricsde_DE
dc.subjectMathematics - Combinatoricsde_DE
dc.subject05C57, 05C40, 05C05, 05C45de_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleFast strategies in waiter-client gamesde_DE
dc.typeArticlede_DE
dc.identifier.doi10.15480/882.3034-
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-882.0111085-
tuhh.oai.showtruede_DE
tuhh.abstract.englishWaiter-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.de_DE
tuhh.publisher.doi10.37236/9451-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.identifier.doi10.15480/882.3034-
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.issue3de_DE
tuhh.container.volume27de_DE
tuhh.container.startpage1de_DE
tuhh.container.endpage35de_DE
dc.rights.nationallicensefalsede_DE
dc.identifier.arxiv2003.09247v3de_DE
dc.identifier.scopus2-s2.0-85092492991de_DE
tuhh.container.articlenumberP3.57de_DE
local.status.inpressfalsede_DE
local.type.versionpublishedVersionde_DE
datacite.resourceTypeArticle-
datacite.resourceTypeGeneralJournalArticle-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.creatorGNDClemens, Dennis-
item.creatorGNDGupta, Pranshu-
item.creatorGNDHamann, Fabian-
item.creatorGNDHaupt, Alexander-
item.creatorGNDMikalaĨki, Mirjana-
item.creatorGNDMogge, Yannick-
item.openairetypeArticle-
item.fulltextWith Fulltext-
item.cerifentitytypePublications-
item.creatorOrcidClemens, Dennis-
item.creatorOrcidGupta, Pranshu-
item.creatorOrcidHamann, Fabian-
item.creatorOrcidHaupt, Alexander-
item.creatorOrcidMikalaĨki, Mirjana-
item.creatorOrcidMogge, Yannick-
item.languageiso639-1en-
item.mappedtypeArticle-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0001-5940-6556-
crisitem.author.orcid0000-0001-7166-1437-
crisitem.author.orcid0000-0003-1919-6325-
crisitem.author.orcid0000-0003-4239-9112-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications with fulltext
Files in This Item:
File Description SizeFormat
9451-PDF file-33488-1-10-20200910.pdfVerlags-PDF435,08 kBAdobe PDFView/Open
Thumbnail
Show simple item record

Page view(s)

195
Last Week
0
Last month
4
checked on Aug 15, 2022

Download(s)

63
checked on Aug 15, 2022

SCOPUSTM   
Citations

1
Last Week
0
Last month
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 Creative Commons