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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 19, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Rahul Savani (Department of Computer Science, Univ. of Warwick, UK)

From discounted payoff games to P-matrix linear complementarity problems

We present discounted payoff games, which are one of a number of two-player zero-sum games of infinite duration played on finite graphs that have the property that the natural associated decision problem is in NP and coNP, yet no polynomial-time algorithms are known. We then present the P-matrix linear complementarity problem (LCP), for which the existence of a polynomial-time algorithm is also a major open problem. LCPs generalize LPs and the bimatrix game equilibrium problem. Finally, we present a simple reduction from discounted payoff games to P-matrix LCPs.

Joint work with Hugo Gimbert and Marcin Jurdziński.

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

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