Perfect-information construction for distributed games

Date: Tuesday, October 18, 2011
Speaker: Dietmar Berwanger
Venue: IST Austria

This talk will be at 16:00 in the CS Meeting Room.

We present a construction for turning games with imperfect information into games with perfect information by preserving winning strategies. The generic construction yields an infinite game tree. For games with observable objectives, we define an abstraction method that yields finite, and thus decidable, instances in some relevant cases and furthermore provides a semi-decision procedure for solving distributed games. The talk is on joint work with Lukasz Kaiser and Bernd Puchala forthcoming at FSTTCS 2011.

Posted in RiSE Seminar