• MATH6002 - Deterministic OR Methods
• MANG6046 - Mathematical Programming
• MANG6100 - Game Theory for Business Applications
• MATH6005 - Visual Basic and Applications
• MATH3016 - Optimization

(EPSRC Fellowship) Cooperative Game Theory: New Mathematical and Algorithmic Approaches

Cooperative game theory is a branch of game theory that offers a conceptually simple and intuitive mathematical framework to model collaborative settings involving multiple decision makers (players). Solutions of cooperative games offer different ways to share the profit or cost among the players in a way that ensures the fairness and stability of the collaboration, while considering the possibility that any subgroup of players has the option to form their own coalition.

The focus of this project is on the most generic class of cooperative games - the integer maximisation games. These games arise in settings where the players in each coalition need to solve an integer maximisation problem to achieve the best interests of their coalition. The proposed research addresses a fundamental question of how to distribute payoff under a new paradigm with the presence of uncertainty and in the context of reasonably large games.

The research also aims to address a fundamental challenge in operational research, which is how to efficiently solve a large number of discrete optimisation problems sharing some common structures.