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, May 20, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Johannes Lengler (Uni Saarbrücken)

Automata Liar Games

A Liar Game is a game between two adversary players, Paul and Carole. The basic variant is as follows. Carole chooses secretly one out of n coins. Now Paul may ask arbitrary YES-/NO-questions. Carole must answer his questions, but she is allowed to lie at most k times. We are interested in the minimal number of questions that Paul needs in order to find out Carole's secret.

I will briefly mention some variants of Liar Games and show how they can be modelled in the general framework of Automata Liar Games. I will present formal weight functions as the main tool for studying such games. Finally, I will show that this approach solves the game exactly for a rich class of Liar Games, for large n.

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