Anil Seth
Date: Friday, September 23rd, 2011
Time: 5:15 PM
Venue: CS101.
In this talk, I will speak on multiplayer pushdown games with qualitative winning conditions. These generalize infinite two player games on pushdown graphs and are non-zero sum games.
I will start with a brief background and related results on non-zero sum games in finite arena and then go onto describe my recent work, where I give an effective procedure to compute a subgame perfect equilibrium (SPE) in any multiplayer pushdown game. Further the strategies in this SPE can be implemented by each agent using a pushdown automaton.