Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, July 20, 2006, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Felix Fischer (Univ. of Munich)
Strategic games may exhibit symmetry in a variety of ways. A common aspect, enabling the succinct representation of games when the number of players is unbounded, is that players can not or need not distinguish between the other players. In this talk, we investigate four classes of symmetric games obtained by considering two additional properties: identical payoff functions for all players and the ability to distinguish oneself from the other players. We show that pure Nash equilibria can be found efficiently in all four classes if only a constant number of actions is available to each player, a problem that is intractable for other succinct representations of multi-player games. We further show that identical payoff functions simplify the search for equilibria, while a growing number of actions renders it intractable.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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