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 04, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Antonis Thomas (University of Edinburgh)

Pure Nash Equilibria and Treewidth

We consider the complexity of w-PNE-GG, the problem of computing pure Nash equilibria in graphical games parameterized by the treewidth w of the underlying graph. It is well-known that the problem of computing such equilibria is NP-hard in general, but solvable in polynomial time when restricted to games of bounded treewidth. We prove that w-PNE-GG is W[1]-hard and thus a fixed-parameter algorithm is unlikely.

Furthermore, we describe a dynamic programming algorithm for w-PNE-GG. In contrast to the previous algorithms that rely on reductions to other problems, our algorithm treats directly the problem at hand. We show that w-PNE-GG is fixed-parameter tractable when the strategy sets have bounded cardinality.

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