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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 29, 2018, 12:15 pm

Duration: 45 minutes

Location: CAB G51

Speaker: Johannes Obenaus

Trapping Games on Random Boards

This talk is based on a paper by R. Basu, A. E. Holroyd, J. B. Martin and J. Wästlund published in 2016.
Consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. In their paper, they analyze outcomes with optimal play on percolation clusters of Euclidean lattices.
They prove that, on \Z^2 with two different percolation parameters for odd and even sites, the game has no draws provided closed sites of one parity are sufficiently rare compared with those of the other parity (thus favoring one player). It is an open question whether draws can occur when the two parameters are equal.


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

Previous talks by year:   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