Area of Research Interests: 

I am broadly interested in Theoretical Computer Science, more specifically the sub-area of formal methods and verification (sometimes referred to as "Theory B"). I am actively working in the area of Games on Graphs, especially Bidding games on graphs, and its application in formal methods. 

Bidding games (on graphs) is a model of two-player interactions (often between a system and its environment) where the players participate in an auction in each turn in order to decide the control of that turn. We study (on theoretical side) if (existence) and how (computing winning strategy) a player can win such a game. If successful, this gives us a correct-by-design controller for a given system, or assurance if there is none. Furthermore, we are currently looking at (on more practical side)  how and if bidding games theoretic solutions can work for areas like decentralised controller synthesis. 

More on these here, and the papers listed below.