Recent Research
2026
1. On Condorcet's Jury Theorem with Abstention Reshef Meir, Ganesh Ghalme AAAI 2026, pp. 17153–17160 [DOI]
2025
2. Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness Piyushi Manupriya, Himanshu, Saketha Nath Jagarlapudi, Ganesh Ghalme AAMAS 2025, pp. 1436–1444 [ACM] | [arXiv]
3. Anytime Fairness Guarantees in Stochastic Combinatorial MABs: A Novel Learning Framework Subham Pokhriyal, Shweta Jain, Ganesh Ghalme, Vaneet Aggarwal AAMAS 2025, pp. 1660–1669 [ACM]
4. Regret Guarantees for a UCB-based Algorithm for Volatile Combinatorial Bandits Abhishek Kumar, Andra Siva Sai Teja, Ganesh Ghalme, Sujit Gujar, Y. Narahari AAMAS 2025, pp. 2762–2764 [ACM]
2024
5. Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits Subham Pokhriyal, Shweta Jain, Ganesh Ghalme, Swapnil Dhamal, Sujit Gujar AAMAS 2024, pp. 1576–1584 [ACM] | [arXiv]
6. Capacitated Online Clustering Algorithm Shivam Gupta, Shweta Jain, Narayanan C. Krishnan, Ganesh Ghalme, Nandyala Hemachandra ECAI 2024, pp. 1880–1887 [DOI]
7. Online Algorithm for Clustering with Capacity Constraints Shivam Gupta, Shweta Jain, Narayanan C. Krishnan, Ganesh Ghalme, Nandyala Hemachandra COMAD/CODS 2024, pp. 572–573 [DOI]
8. Condorcet's Jury Theorem with Abstention (preprint) Ganesh Ghalme, Reshef Meir CoRR abs/2408.00317 [arXiv]