Abheek Ghosh
Abheek Ghosh
Room
017,
Wolfson Building,
Parks Road, Oxford OX1 3QD
United Kingdom
Biography
I am a third-year Ph.D. student supervised by Profs. Edith Elkind and Paul Goldberg. My research has primarily focused on contest theory. I spent a summer working with Prof. Milind Tambe and the AI4SG and MLO groups at Google Research on restless multi-armed bandits. I have previously worked with Prof. Umang Bhaskar at TIFR on voting theory.
Selected Publications
-
Indexability is Not Enough for Whittle: Improved‚ Near−Optimal Algorithms for Restless Bandits
Abheek Ghosh‚ Dheeraj Nagaraj‚ Manish Jain and Milind Tambe
In Proceedings of the 2023 International Conference on Autonomous Agents & Multiagent Systems (AAMAS). 2023.
arXiv:2211.00112
Details about Indexability is Not Enough for Whittle: Improved‚ Near−Optimal Algorithms for Restless Bandits | BibTeX data for Indexability is Not Enough for Whittle: Improved‚ Near−Optimal Algorithms for Restless Bandits
-
Complexity of Deliberative Coalition Formation
Edith Elkind‚ Abheek Ghosh and Paul Goldberg
In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). Vol. 36. No. 5. Pages 4975–4982. 2022.
arXiv:2202.12594
Details about Complexity of Deliberative Coalition Formation | BibTeX data for Complexity of Deliberative Coalition Formation
-
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy
Edith Elkind‚ Abheek Ghosh and Paul Goldberg
In Proceedings of the Symposium in Algorithmic Game Theory (SAGT). 2022.
arXiv:2207.08151
Details about Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy | BibTeX data for Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy