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, June 01, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Rajko Nenadov

The determinism of randomness: a game-theoretic approach

Consider the following two-player game played on the edges of Kn, a complete graph with n vertices: In each round the first player chooses b edges, which they have not previously chosen, and the second player immediately and irrevocably picks one of them and adds it to the initially empty graph G. The game ends when there are less than b edges that the first player can offer. The first player wins if G contains some graph H, which the players have agreed upon in advance, and otherwise the second player wins. How large can b be such that the first player has a winning strategy? The answer is closely related to random graphs and intuition we have about them. The proof is, at the same time, entirely deterministic and completely probabilistic.

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