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: Tuesday, March 11, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Dennis Clemens (Freie Universität Berlin)

On the threshold bias of the Oriented-cycle game

In the Oriented cycle game, the two players, called OMaker and OBreaker, alternately direct edges of the complete graph on n vertices. OMaker directs exactly one edge, whereas OBreaker is allowed to direct between one and b edges in each round. OMaker wins if the final tournament contains a directed cycle, otherwise OBreaker wins. It is not that difficult see that OMaker has a winning strategy for this game whenever b < n/2 - 2, whereas OBreaker wins for b>n-3. We show that OBreaker has a strategy whenever b > 5n/6. Moreover, we also show that in a variant, where OBreaker is asked to direct exactly b edges in each round, OBreaker wins whenever b>19n/20. Joint work with Anita Liebenau.

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