Palash Dey

Palash Dey is an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology, Kharagpur. His research lies at the intersection of theoretical computer science and algorithmic game theory, with a primary focus on computational social choice, voting theory, and parameterized algorithms.

His research interests include:

• Theoretical Computer Science
• Parameterized Algorithms
• Approximation Algorithms
• Algorithmic Game Theory
• Computational Social Choice
• Voting Theory
• Algorithmic Fairness
• Network Games

His recent publications, spanning from 2023 to 2025, demonstrate a strong and consistent research trajectory in the analysis of voting systems, manipulation, and fairness. The articles focus on complex problems such as bribery, gerrymandering, rank aggregation, and networked public goods, primarily using tools from parameterized complexity and algorithmic game theory. Key venues for his work include AAMAS, IJCAI, AAAI, and Theoretical Computer Science, indicating a high impact in the fields of AI and theoretical computer science.

His professional service includes being the Newsletter and Social Media Chair of the IEEE Kharagpur Section and serving on the Senior Program Committee for AAAI (2021-2024) and the Program Committee for AAAI, IJCAI, AAMAS, and COMSOC. He has also organized significant workshops such as CALDAM 2019 and GAME-ARTS.

Palash Dey actively advises Ph.D. students, including Sipra Singh, Koustav De, Ashlesha Hota, and Narayan Sharma. He teaches courses such as Algorithms II, Randomized Algorithm Design, and Algorithmic Game Theory. His email is palash.dey@cse.iitkgp.ac.in.