On weight function methods in chooser-picker games
From MaRDI portal
Publication:1939273
DOI10.1016/j.tcs.2012.12.037zbMath1282.91053OpenAlexW2080607547MaRDI QIDQ1939273
Publication date: 4 March 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.037
Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (9)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Picker-chooser fixed graph games ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Fast strategies in Waiter-Client games ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ Client-waiter games on complete and random graphs ⋮ Probabilistic intuition holds for a class of small subgraph games ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
This page was built for publication: On weight function methods in chooser-picker games