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 29, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Tibor Szabó

The Discrepancy Game

The Discrepancy game is played on a hypergraph H by two players, Balancer and Unbalancer, who color the still uncolored vertices of H alternately, say Balancer using RED and Unbalancer using BLUE. Balancer's goal is that at the end of the game there are roughly the same number of red and blue vertices in every edge. Unbalancer's goal is to make an edge unbalanced. We give a criterion and strategy for Balancer to win.

(Joint work with N. Alon, M. Krivelevich and J. Spencer)

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

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