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

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Leo Rüst

Simple Stochastic Games via P-matrix Linear Complementarity Problems

I will present the Simple Stochastic Game (SSG) problem and show how to reduce it to a Linear Complementarity Problem (LCP). The matrix of the resulting LCP is proved to have a special property: It is a P-matrix. The reduction makes the rich P-matrix LCP theory and numerous existing algorithms available for SSG.

(Joint work with Bernd Gärtner)


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