University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Strategy Stealing in Avoidance Games

## Strategy Stealing in Avoidance GamesAdd to your list(s) Download to your calendar using vCal - Robert Johnson (Queen Mary)
- Thursday 04 May 2017, 15:00-16:00
- LTC Watson.
If you have a question about this talk, please contact Dr Andrew Treglown. Let H be a hypergraph. In the achievment game on H, two players take it in turns to colour vertices of H in their own colour. The player who first achieves an edge of H in their colour wins. The well known strategy stealing argument shows that for any H this game is either a first player win or a draw. We consider the avoidance (or misere) version of this game in which the first player to achieve an edge of H in their colour loses. A plausible hope (implicit in a remark of Beck) is that when H is transitive, the avoidance game is either a second player win or a draw. We show that this is false and investigate what possible extra conditions on H may make it true. Joint work with Imre Leader and Mark Walters. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsTheoretical Physics Seminars Algebra Seminar Nuclear physics seminars## Other talksPost-mortem privacy – theory, law and technology Verification of Byzantine Fault Tolerant Systems Rage against the dying of the light: Type Ia supernovae at 1000 days and beyond How hard is LWE anyway? FENL: an ISE to mitigate analogue micro-architectural leakage School Seminar |