Strategy Synthesis for Multi-agent Games of Imperfect Information With Partially Given Strategies

Abstract: Finding strategies for games have been of interest tohumans throughout history. With the advancement of technologyand the way the financial market is compounded, enormous timeand resources are spent on modelling real world problems asgames and searching for strategies modelled to enhance produc-tivity and rule out inefficiencies. This thesis aims to investigate the existence of strategies that would allow players (agents)to complete common objectives when one category of agentsalready have a given strategy. This is done through studyingan example and investigating the application and implicationof the introduction of an abstraction function. The performedstudy concluded that if such a function could be more rigorouslymathematically formulated, it could increase the effectiveness ofstrategy searches and synthesis in the field.