Soumyajit Paul

Broadly, I am interested in algorithmic game theory and stochastic systems. In the past, I have worked on complexity of computing equilibrium in finite stochastic games with imperfect information. I have also been working on a theoretical model for Bridge Bidding.

My other research interests include formal methods and verification, combinatorics. I also enjoy thinking about theoretical questions that have direct and interesting applications.

Publications

• Simplifying Imperfect Recall Games
  Hugo Gimbert, Soumyajit Paul, B. Srivathsan - AAMAS 2025 (Full paper)
  Arxiv
• Pushable chromatic number of graphs with degree constraints
  Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena - Discrete Mathematics, 2021
  Journal version
• A Bridge between Polynomial Optimization and Games with Imperfect Recall
  Hugo Gimbert, Soumyajit Paul, B. Srivathsan - AAMAS 2020 (Full paper)
  Arxiv | Conference version

PhD thesis

On the algorithmic complexity of two player zero-sum games of finite duration with imperfect information

At University of Liverpool (In English)

• Competitive programming sessions [2024-2025]

At Université Paris Cité as ATER (In French)

TD (Problem solving sessions), TP (Lab sessions), cours (Course)

• Grammars and Parsing (Bachelor's 3rd yr) - TD/TP [2023]
• Scripting Language (Bachelor's 3rd yr) - cours/TP [2022 & 2023]
• Concepts in Computer Science (Bachelor's 1st yr) - TD [2023]
• Introduction to programming 2 (Bachelor's 1st yr) - TP [2022]
• Introduction to programming 1( Bachelor's 1st yr) - TP/coursTD [2022]
• Computer Science 1 (CUPGE Prepa) (Bachelor's 1st yr) - TP [2022]

At Chennai Mathematical Institute as Teaching Assistant (In English)

• Theory of Computation [Aug-Dec 2017]
• Discrete Mathematics [Jan-Apr 2017]
• Games on Graphs [Aug-Dec 2016]