|
|
|
|
|
|
|
|
|
|
|
- First meeting: Thu, 31.01.2013 in 03.09.014 at 11:00
- Final assignment of papers: done.
- Time schedule for the presentations: see below.
- We start every session at 12:00 (sharp!).
Schedule (see Michael's slides)
- 4 weeks before the talk
- meeting with advisor
- must have read the paper
- fix structure
- 2 weeks before the talk
- preliminary version of the slides
- 1 week before the talk
- final version of the slides
- preliminary version of written summary (4-6 pages)
- 2 weeks after the talk
- final version of the summary
| Date
| Room
| Topic
| Speaker
| Advisor
|
| 24.6. |
01.09.014 |
Memoryless Determinancy of Parity Games and Zielonka's Algorithm |
Katrin Kehrbusch |
Maximilian Schlund |
| 24.6. |
01.09.014 |
Small-Progress Measures for Solving Parity Games |
Imre Vadasz |
Jan Kretinsky |
| 25.6. |
01.09.014 |
Reducing Parity Games to Linear Programming |
Thomas Rebele |
Michael Luttenberger |
| 25.6. |
01.09.014 |
Playing Muller Games in a Hurry |
Dieter Panin |
Maximilian Schlund |
| 26.6. |
01.09.014 |
Simple Stochastic Games and MDPs: Applications and How to Solve Them. |
Philipp Meyer |
Michael Luttenberger |
| 26.6. |
01.09.014 |
Parity Games Induced by Recursive Programs |
Georg Bachmeier |
René Neumann |
| 2.7. |
01.09.014 |
CEGAR for Games |
Philipp Hoffmann |
Javier Esparza |
| 3.7. |
01.09.014 |
Solving Games of Imperfect Information |
Sebastian Vöst |
Jan Kretinsky |
| 3.7. |
01.09.014 |
Concurrent Reachability Games |
Dennis Kraft |
René Neumann |
|
|
|
|
|
|
|
|
Contact
Teaching
