Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, July 31, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Gal Kronenberg (Tel Aviv University)

Random-turn Maker-Breaker games

We consider random-turn Maker-Breaker games, firstly introduced by Peres, Schramm, Sheeld and Wilson in 2007. A p-random-turn Maker-Breaker game is the same as an ordinary Maker-Breaker game, except that instead of alternating turns, a coin is being tossed before each turn to decide the identity of the next player to move (the probability of Maker to move is p). We analyze the random-turn version of several classical games such as the game Box (introduced by Chvátal and Erdős in 1987) and its balancing version, the Hamilton cycle game, the game of creating a copy of a fixed graph H (both played on the edge set of Kn), etc. For each such game we establish the asymptotic order of the minimum value of p for which Maker typically wins the game. Joint work with: Asaf Ferber and Michael Krivelevich

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login