| CARVIEW |
Soumyajit Paul
সৌম্যজিৎ
I am currently a post-doctoral researcher at the Department of Computer Science, University of Liverpool with Sven Schewe and Dominik Wojtczak .
My research is in algorithmic game theory and formal verification.
Previously, I was a Teaching and Research Fellow (ATER) at Université Paris Cité affiliated to IRIF.
I completed my PhD from LaBRI, Université de Bordeaux under the supervision of Hugo Gimbert, B. Srivathsan and Olivier Ly.
Before that, I completed my B.Sc in Mathematics and Computer Science and M.Sc in Computer Science from Chennai Mathematical Institute.
The area of my research is theoretical computer science. Broadly, I am interested in algorithmic game theory, stochastic systems and formal verification. During my PhD, I have worked on complexity of equilibrium computations in finite stochastic games with imperfect information.
I also enjoy thinking about theoretical questions that have direct and interesting applications. I have been working on a theoretical model for finding optimal strategies in Bridge Bidding.
Preprints
-
On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
Vincent Cheval, Florian Horn, Soumyajit Paul, Mahsa Shirmohammadi
Arxiv
Publications
-
Generalised Reachability Games Revisited
Sougata Bose, Daniel Hausmann, Soumyajit Paul, Sven Schewe, Tansholpan Zhanabekova
GandALF 2025 (To appear)
-
Resolving Nondeterminism by Chance
Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen
CONCUR 2025 (To appear)
Arxiv | Conference version -
Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata
Yong Li, Soumyajit Paul, Sven Schewe, Qiyi Tang
CAV 2025
Conference version | Slides -
Simplifying Imperfect Recall Games
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
AAMAS 2025 (Full paper)
Arxiv | Conference version | Slides -
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]