I am a doctoral student in the Computer and Information Science Department at the School of Engineering and Applied Science of the University of Pennsylvania. I joined the doctoral program in Fall 2006. My doctoral advisors are Prof. Sanjeev Khanna and Prof. Michael Kearns.
Before joining the doctoral program at Penn, I completed my undergraduate in Mathematics from Chennai Mathematical Institute, India. Before that, I finished my schooling from my hometown Durgapur in the state of West Bengal, India, from St. Xaviers School and DAV Model School.
Email: tanmoy AT seas DOT upenn DOT edu, tanmoych1985 AT gmail DOT com
My broad research interests are Algorithms and Applied Mathematics. Currently, I am working on problems in Algorithmic Game Theory and Computational Economics.
Nash Dynamics in Congestion Games with Similar Resources (with Anand Bhalgat and Sanjeev Khanna): Submitted, 2009.
Nash Dynamics in Constant Player and Bounded Jump Congestion Games (with Sanjeev Khanna): To appear in the Symposium on Algorithmic Game Theory (SAGT), 2009.
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization (with Zhiyi Huang and Sanjeev Khanna): To appear in the IEEE Symposium on Foundations of Computer Science (FOCS), 2009.
Network Bargaining: Algorithms and Structural Results (with Michael Kearns and Sanjeev Khanna): To appear in the ACM Conference on Electronic Commerce (EC), 2009.
Bargaining Solutions in a Social Network (with Michael Kearns): Appeared in the Proceedings of the International Workshop on Internet and Network Economics (WINE), 2008.
Network Design for Vertex Connectivity (with Julia Chuzhoy and Sanjeev Khanna ): Appeared in the Proceedings of the ACM Symposium on Theory of Computation (STOC), 2008, pp. 167-176.
One-input-face MPCVP is Hard for L, but in LogDCFL (with Samir Datta): Appeared in the Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), 2006, pp. 57-68.
Grid Graph Reachability Problems (with Eric Allender, David A. Mix Barrington, Samir Datta and Sambuddha Roy): Appeared in the Proceedings of the IEEE Conference on Computational Complexity (CCC), 2006, pp. 299--313.
Generalization of a Result of Erdos : I generalized a result proved by Paul Erdos on sum-free subsets of sets of integers, during an independent study course in May-June, 2004, on Probabilistic Methods under Prof. K. V. Subrahmanyam.
Turing Degrees and Post's Problem : I prepared this report during an independent study course in May-June, 2006, under Prof. David Madore, while visiting the Ecole Normale Superieure, Paris.