Game Solving: Theory and Practice
- a satellite event of ICALP 2018 in Prague, Czech Republic, July 9, 2018
The aim of the workshop is to discuss connections between (algorithmic) game theory and computational aspects of game solving. Several decades of mostly theoretical research produced a multitude of algorithms for solving various types of games. However, most of these algorithms are only theoretical constructs that either have never been implemented, or have been executed only on toy problems. On the other hand, there are many concrete problems that can be expressed in the language of game theory. Apart from traditional models of economic behaviour, there is a large field of board and computer games, security games, games in verification of systems, etc. The workshop provides ground for a meeting of researchers developing theoretical solutions of abstract games with researchers modelling and solving real-world problems using games.
Invited talks will be delivered by
The invitations were only possible due to the support by the European Network for Game Theory GAMENET, which is a COST Action funded project (CA 16228). COST (European Cooperation in Science and Technology) is a funding agency for research and innovation networks.
Since the aim of the workshop is to stimulate discussion on the exchange between the theoretical and practical view of game theory, we invite presentations of possibly already published as well as ongoing work.
The submissions should be abstracts of such work, limited to at most two pages in the llncs style, and will only be published in the informal pre-proceedings for the convenience of the participants. There will be no formal publication or post-proceedings.
The submission are to be done over Easychair.
- Paper submission: April 20, 2018
- Notification: May 18, 2018
- Final versions for informal pre-proceedings: May 31, 2018
|8:50 - 9:00 ||Opening Remarks |
|9:00 - 10:30 ||Invited talk: Krishnendu Chatterjee|
|10:30 - 11:00 ||Coffee Break|
|11:00 - 11:20 ||Jean-Francois Raskin: Online reinforcement learning for mean-payoff with parity guarantees.|
|11:20 - 11:40 ||Soumyajit Paul: Algorithms for non co-operative team games.|
|11:40 - 12:00 ||Antonin Kucera: Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment.|
|12:00 - 12:20 ||Fei Fang: Designing the Game to Play: Optimizing Payoff Structure in Security Games|
|12:30 - 14:00 ||Lunch|
|14:00 - 15:30 ||Invited talk: Quanyan Zhu|
|15:30 - 16:00 ||Coffee Break|
|16:00 - 16:20 ||Karel Horak: One-Sided Partially Observable Stochastic Games and Their Extensions|
|16:20 - 16:40 ||Karel Durkota: Game Theoretic Approach to Network Security Configuration Problems|
|16:40 - 17:00 ||Jakub Cerny: Automata Playing Extensive Form Games: Definition and equilibrial complexity|
In case of any questions, please contact the organizer Jan Kretinsky at <name>.<surname>@tum.de
Looking forward to seeing you in Prague!