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]
2023
9. A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi WINE 2023, pp. 310–328 [arXiv]
10. Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan IJCAI 2023, pp. 4100–4108 [arXiv]
11. Group Fair Clustering Revisited – Notions and Efficient Algorithm Shivam Gupta, Ganesh Ghalme, Narayanan C. Krishnan, Shweta Jain AAMAS 2023, pp. 2854–2856
12. Designing Fair, Cost-Optimal Auctions Based on Deep Learning for Procuring Agricultural Inputs Through Farmer Collectives Mayank Ratan Bhardwaj, Bazil Ahmed, Prathik Diwakar, Ganesh Ghalme, Y. Narahari IEEE CASE 2023, pp. 1–8 [arXiv]
13. Algorithmic Recourse based on User's Feature-order Preference Manan Singh, Sai Srinivas Kancheti, Shivam Gupta, Ganesh Ghalme, Shweta Jain, Narayanan C. Krishnan COMAD/CODS 2023, pp. 293–294
14. Efficient Algorithms for Fair Clustering with a New Fairness Notion Shivam Gupta, Ganesh Ghalme, Narayanan C. Krishnan, Shweta Jain Data Mining and Knowledge Discovery (DMKD), pp. 1–39, 2023
15. Group and Individual Fairness in Clustering Algorithms [Book Chapter] Shivam Gupta, Shweta Jain, Ganesh Ghalme, Narayanan C. Krishnan, Nandyala Hemachandra AI and Ethics, Springer, 2023
2022
16. Individual Fairness in Feature-Based Pricing for Monopoly Markets Shantanu Das, Swapnil Dhamal, Ganesh Ghalme, Shweta Jain, Sujit Gujar UAI 2022 [arXiv]
17. Strategic Representation Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld ICML 2022 [arXiv]
18. Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment Ganesh Ghalme, Vineet Nair, Vishakha Patil, Yilun Zhou AAMAS 2022 [PDF]
2021
19. Strategic Classification in the Dark Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld ICML 2021 [PDF]
20. Ballooning Multi-armed Bandits Ganesh Ghalme, Swapnil Dhamal, Shweta Jain, Sujit Gujar, Y. Narahari Journal of Artificial Intelligence, 2021 (Preliminary version at AAMAS 2020) [arXiv]
2020
21. Achieving Fairness in Stochastic Multi-armed Bandits Ganesh Ghalme, Vishakha Patil, Vineet Nair, Y. Narahari AAAI 2020 (oral) [arXiv]
2019
22. Fair Division of Indivisible Goods Among Strategic Agents Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang AAMAS 2019 (short paper) [arXiv]
2018
23. Design of Coalition Resistant Credit Score Functions for Online Discussion Forums Ganesh Ghalme, Amleshwar Kumar, Sujit Gujar, Shweta Jain, Y. Narahari AAMAS 2018 [PDF]
2017
24. Analysis of Thompson Sampling for Stochastic Sleeping Bandits Ganesh Ghalme, Aritra Chatterjee, Shweta Jain, Rohit Vaish, Y. Narahari UAI 2017 [PDF]
25. Thompson Sampling Based Mechanisms for Stochastic Multi-Armed Bandit Problems Ganesh Ghalme, Shweta Jain, Sujit Gujar, Y. Narahari AAMAS 2017 [PDF]
2016
26. A Deterministic MAB Mechanism for Crowdsourcing with Logarithmic Regret and Immediate Payment Ganesh Ghalme, Shweta Jain, Satyanath Bhat, Sujit Gujar, Y. Narahari AAMAS 2016 [PDF]
27. Mechanisms with Learning for Multi-Armed Bandits Problems Ganesh Ghalme, Shweta Jain, Satyanath Bhat, Divya Padmanabhan, Y. Narahari IJPAM 2016 [PDF]