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
-
Resolving Nondeterminism by Chance
Soumyajit Paul, David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke, Di-De Yen
Arxiv
Publications
-
Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata
Yong Li, Soumyajit Paul, Sven Schewe, Qiyi Tang
CAV 2025 (To appear)
-
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
