Abheek Ghosh

I am a postdoctoral researcher at TU Munich. I completed my Ph.D. at Oxford, supervised by Profs. Edith Elkind and Paul W. Goldberg. I work in economics and computation, and my recent research has focused on computational complexity, contest theory, and learning dynamics in games.

Email: firstname (dot) lastname (at) tum.de CV

Publications

Ph.D. Thesis: Contests: Equilibrium Analysis, Design, and Learning [link]

Authors are ordered alphabetically as usually done in TCS.

Equilibrium Points of an Electrostatic Potential [arXiv]
Abheek Ghosh, Paul W. Goldberg, Alexandros Hollender. ITCS '26.

Fraud-Proof Revenue Division in Subscription Platforms [arXiv]
Abheek Ghosh, Tzeh Yuan Neoh, Nicholas Teh, Giannis Tyrovolas. ICML '25.

The Complexity of Symmetric Bimatrix Games with Common Payoffs [arXiv]
Abheek Ghosh, Alexandros Hollender. WINE '24.

Continuous-Time Best-Response and Related Dynamics in Tullock Contests with Convex Costs [arXiv]
Edith Elkind, Abheek Ghosh, Paul W. Goldberg. WINE '24.

Best-Response Dynamics in Tullock Contests with Convex Costs [arXiv]
Abheek Ghosh. WINE '23.

Best-Response Dynamics in Lottery Contests [arXiv]
Abheek Ghosh, Paul W. Goldberg. EC '23.

Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless Bandits [arXiv]
Abheek Ghosh, Dheeraj Nagaraj, Manish Jain, Milind Tambe. AAMAS '23.

Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy [arXiv]
Edith Elkind, Abheek Ghosh, Paul W. Goldberg. SAGT '22.

Contests to Incentivize a Target Group [arXiv]
Edith Elkind, Abheek Ghosh, Paul W. Goldberg. IJCAI '22.

Complexity of Deliberative Coalition Formation [arXiv]
Edith Elkind, Abheek Ghosh, Paul W. Goldberg. AAAI '22.

Contest Design with Threshold Objectives [arXiv]
Edith Elkind, Abheek Ghosh, Paul W. Goldberg.
International Journal of Game Theory, 2025. Preliminary version at WINE '21.

On the Welfare of Cardinal Voting Mechanisms [link]
Umang Bhaskar, Abheek Ghosh. FSTTCS '18.

Truthful and Near-Optimal Mechanisms for Welfare Maximization in Multi-Winner Elections [link]
Umang Bhaskar, Varsha Dani, Abheek Ghosh. AAAI '18.

Working Papers

The Complexity of Sparse Win-Lose Bimatrix Games [arXiv]
Eleni Batziou, John Fearnley, Abheek Ghosh, Rahul Savani.

The Complexity of Unique Nash Equilibrium
Abheek Ghosh, Paul W. Goldberg, Alexandros Hollender.

Persuading a Credible Agent [arXiv]
Jiarui Gan, Abheek Ghosh, Nicholas Teh.

Pure-Strategy Nash Equilibria in Parallel Tullock Contests
Abheek Ghosh, Paul W. Goldberg.

Bayesian Learning Dynamics in Contests with Bandit Feedback
Abheek Ghosh, Paul W. Goldberg, Sonja Kraiczy, Edwin Lock.

Other Activities

Teaching Experience (TA/Tutorials)

University of Oxford
Continuous Mathematics, Spring 2025.
Algorithmic Foundations of Collective Decision Making, Spring 2024.
Combinatorial Optimization, Fall 2023, Departmental Teaching Award.
Computational Game Theory, Spring 2023.
Probability and Computing, Fall 2022.
Complexity Theory, Spring 2022.

University of Texas at Austin
Algorithms and Complexity, Spring 2020.
Scientific and Technical Computing, Fall 2018, 2019.
Debugging and Verification, Spring 2019.

Reviewer / PC Member

Journals: Journal of the ACM, Economic Theory, Games and Economic Behavior, Theoretical Computer Science, ACM Transactions on Computation Theory.
Conferences: STOC, EC, WINE, SAGT, ICALP, STACS, ISAAC, MFCS, NeurIPS, AAAI, IJCAI, AAMAS.

Google Sites

Report abuse