Tanmoy Chakraborty

About Me

I am a postdoctoral fellow at the Center for Research on Computation and Society (CRCS), Harvard University. I work closely with the EconCS Group at the Harvard School of Engineering and Applied Science. I recently completed my PhD in Computer and Information Science from University of Pennsylvania, where I was advised by Michael Kearns and Sanjeev Khanna. Before joining the doctoral program at Penn, I completed my undergraduate in mathematics from Chennai Mathematical Institute, India.

Contact

Address:
MD 110 (CRCS), Harvard University
33 Oxford Street
Cambridge, MA 02138.
         Email:
tanmoy AT seas DOT harvard DOT edu
OR
tanmoych1985 AT gmail DOT com
        Tanmoy Chakraborty

Curriculum Vitae

Research Interests

My research interests lie in economics and computation, with a strong focus on stochastic models and optimization. In particular, I have worked on theoretical modeling and behavioral study of social and economic networks, algorithmic game theory, mechanism design, online pricing and financial trading strategies. I am interested in the modeling and analysis of online social and economic systems. Here are my research statement and my doctoral dissertation.

Publications

Please see below for a classification of my publications into categories. You can find a chronological list here , and here is my list of publications on the DBLP Computer Science Bibliography.

Networked Bargaining

A Behavioral Study of Bargaining in Social Networks
(with Stephen Judd, Michael Kearns and Jinsong Tan)
ACM Conference on Electronic Commerce (EC), 2010.
[abstract] [PDF]
Network Bargaining: Algorithms and Structural Results
(with Michael Kearns and Sanjeev Khanna)
ACM Conference on Electronic Commerce (EC), 2009.
[abstract] [PDF]
Bargaining Solutions in a Social Network
(with Michael Kearns)
Workshop on Internet and Network Economics (WINE), 2008.
[abstract] [PDF]

Mechanism Design and Pricing

Mechanism Design for Risk Averse Sellers
(with Anand Bhalgat and Sanjeev Khanna)
Workshop on Internet and Network Economics (WINE), 2012.
[abstract] [PDF]
Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions
(with Eyal Even-Dar, Sudipto Guha, Yishay Mansour and S. Muthukrishnan)
Workshop on Internet and Network Economics (WINE), 2010.
[abstract] [PDF]
Selective Call Out and Real Time Bidding
(with Eyal Even-Dar, Sudipto Guha, Yishay Mansour and S. Muthukrishnan)
Workshop on Internet and Network Economics (WINE), 2010.
[abstract] [PDF]
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization
(with Zhiyi Huang and Sanjeev Khanna)
IEEE Symposium on Foundations of Computer Science (FOCS), 2009.
Full version to appear in SIAM Journal of Computing (SICOMP) (special issue with select papers from FOCS 2009).
[abstract] [PDF]

Computational Finance

Market Making and Mean Reversion
(with Michael Kearns)
ACM Conference on Electronic Commerce (EC), 2011.
[abstract] [PDF]

Game-Theoretic Complexity

Approximating Pure Nash Equilibrium in Cut, Party Affiliation and Satisfiability Games
(with Anand Bhalgat and Sanjeev Khanna)
ACM Conference on Electronic Commerce (EC), 2010.
[abstract] [PDF]
Nash Dynamics in Congestion Games with Similar Resources
(with Anand Bhalgat and Sanjeev Khanna)
Workshop on Internet and Network Economics (WINE), 2009.
[abstract] [PDF]
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
(with Sanjeev Khanna)
Symposium on Algorithmic Game Theory (SAGT), 2009.
[abstract] [PDF]

Miscellaneous: Graph Theoretic Algorithms and Computational Complexity

Network Design for Vertex Connectivity
(with Julia Chuzhoy and Sanjeev Khanna)
ACM Symposium on Theory of Computation (STOC), 2008.
[abstract] [PDF]
One-input-face MPCVP is Hard for L, but in LogDCFL
(with Samir Datta)
Foundations of Software Technology and Theoretical Computer Science (FST&TCS), 2006.
[abstract] [PDF]
Planar and Grid Graph Reachability Problems
(with Eric Allender, David A. Mix Barrington, Samir Datta and Sambuddha Roy)
IEEE Conference on Computational Complexity (CCC), 2006.
Full version appeared in Theory of Computing Systems (Volume 45, Issue 4), 2009.
[abstract] [PDF]