Game Theory and Computational Complexity

Home > Workshops > 2014 > Game Theory and Computational Complexity

Game Theory and Computational Complexity

 03 - 04 Mar 2014

University of Strathclyde, Glasgow

About:

Game theory provides tools to solve optimization problems in systems where the participants act independently and their decisions affect the whole system. This two-day workshop brought together experts in high performance computing and algorithm development for games, and experts in theoretical game modelling. The aim was to foster the research in resolving computational challenges in game theory by exchanging knowledge between theoretical and computation game theorist and practitioners.

Speakers:

  • Vassili Kolokotsov, University of Warwick - Mean Field Games with a Common Noise or a Major Player

  • Dario Bauso, University of Palermo - Robust Mean-Field Games

  • Markus Kirkilionis, University of Warwick - The Mighty Emperor, the Lonely Thief, and the Crowd

  • Madhi Parsa, University of Strathclyde - Parameterized Complexity Applied in Algorithmic game theory

  • Bernhard von Stengel, London School of Economics - Recursive Inspection Games

  • Stamatios Katsikas, University of Warwick

  • Alec Morton, University of Strathclyde - Incentives and Behaviour in Hospital Waiting Time Management

  • Rahul Savani, University of Liverpool - Game Theory Explorer: Software for the Applied Game Theorist

  • Thomas Lidbetter, London School of Economics - A Caching Game with Continuous Hiding Material and Continuous Search Effort

  • Alec Dickson, University of Strathclyde

Sponsors and Funders:

This workshop is sponsored by NAIS (Centre for Numerical Algorithms and Intelligent Software).