On weight function methods in chooser-picker games

DOI10.1016/J.TCS.2012.12.037MaRDI QIDQ1939273zbMATH OpenOpenAlexFDO

Authors Małgorzata Bednarska-Bzdȩga

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

zbMATH Keywords

chooser-picker gamescombinatorial gamesmaker-breaker games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• Picker-chooser fixed graph games
• On chooser-picker positional games
• On the complexity of chooser-picker positional games
• The picker-chooser diameter game
• On the optimality of the uniform random strategy

Cited in

(15)

• Fast strategies in Waiter-Client games
• Waiter-client and client-waiter Hamiltonicity games on random graphs
• Waiter-client and client-waiter colourability and \(k\)-SAT games
• Waiter-Client and Client-Waiter planarity, colorability and minor games
• Picker-chooser fixed graph games
• On the complexity of chooser-picker positional games
• On -roughly weighted games
• Client-waiter games on complete and random graphs
• Manipulative waiters with probabilistic intuition
• Probabilistic intuition holds for a class of small subgraph games
• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
• Tree universality in positional games
• Creating spanning trees in Waiter-Client games
• The picker-chooser diameter game
• On the complexity of client-waiter and waiter-client games

This page was built for publication: On weight function methods in chooser-picker games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939273)