|Mittagsseminar Talk Information|
Date and Time: Thursday, May 20, 2010, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
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: 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.3392 | admin login