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: Thursday, February 08, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Dan Hefetz (Tel Aviv Univ.)

Fast winning strategies in positional games

For the unbiased Maker-Breaker game, played on the hypergraph ${\cal H}$, let $\tau_M({\cal H})$ be the smallest integer $t$ such that Maker can win the game within $t$ moves (here we don't necessarily play until all elements of the board are claimed but stop as soon as Maker claims some winning set).

In this talk, we determine the value of $\tau_M$ for various Maker-Breaker games (focusing on connectivity).

The talk will include a short introduction on Maker-Breaker games.

Joint work with Michael Krivelevich, Miloš Stojaković and Tibor Szabó.

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