Achieving fairness in the stochastic multi-armed bandit problem V Patil, G Ghalme, V Nair, Y Narahari Journal of Machine Learning Research 22 (174), 1-31, 2021 | 119 | 2021 |
Strategic classification in the dark G Ghalme, V Nair, I Eilat, I Talgam-Cohen, N Rosenfeld International Conference on Machine Learning, 3672-3681, 2021 | 48 | 2021 |
Fair division of indivisible goods among strategic agents S Barman, G Ghalme, S Jain, P Kulkarni, S Narang arXiv preprint arXiv:1901.09427, 2019 | 34 | 2019 |
Analysis of Thompson Sampling for Stochastic Sleeping Bandits. A Chatterjee, G Ghalme, S Jain, R Vaish, Y Narahari UAI, 2017 | 19 | 2017 |
A deterministic mab mechanism for crowdsourcing with logarithmic regret and immediate payments S Jain, G Ghalme, S Bhat, S Gujar, Y Narahari Proceedings of the 2016 International Conference on Autonomous Agents …, 2016 | 17 | 2016 |
Thompson Sampling Based Mechanisms for Stochastic Multi-Armed Bandit Problems. G Ghalme, S Jain, S Gujar, Y Narahari AAMAS, 87-95, 2017 | 13 | 2017 |
Mechanisms with learning for stochastic multi-armed bandit problems S Jain, S Bhat, G Ghalme, D Padmanabhan, Y Narahari Indian Journal of Pure and Applied Mathematics 47, 229-272, 2016 | 8 | 2016 |
Efficient algorithms for fair clustering with a new notion of fairness S Gupta, G Ghalme, NC Krishnan, S Jain Data Mining and Knowledge Discovery 37 (5), 1959-1997, 2023 | 6 | 2023 |
Strategic representation V Nair, G Ghalme, I Talgam-Cohen, N Rosenfeld International Conference on Machine Learning, 16331-16352, 2022 | 6 | 2022 |
Individual fairness in feature-based pricing for monopoly markets S Das, S Dhamal, G Ghalme, S Jain, S Gujar Uncertainty in Artificial Intelligence, 486-495, 2022 | 5 | 2022 |
Ballooning multi-armed bandits G Ghalme, S Dhamal, S Jain, S Gujar, Y Narahari Artificial Intelligence 296, 103485, 2021 | 5 | 2021 |
Design of coalition resistant credit score functions for online discussion forums G Ghalme, S Gujar, A Kumar, S Jain, Y Narahari Proceedings of the 17th International Conference on Autonomous Agents and …, 2018 | 5 | 2018 |
Long-term resource allocation fairness in average markov decision process (amdp) environment G Ghalme, V Nair, V Patil, Y Zhou arXiv preprint arXiv:2102.07120, 2021 | 4 | 2021 |
State-Visitation Fairness in Average-Reward MDPs G Ghalme, V Nair, V Patil, Y Zhou arXiv preprint arXiv:2102.07120, 2021 | 3 | 2021 |
A discrete and bounded locally envy-free cake cutting protocol on trees G Ghalme, X Huang, Y Machino, N Rathi International Conference on Web and Internet Economics, 310-328, 2023 | 2 | 2023 |
Designing Fair, Cost-Optimal Auctions Based on Deep Learning for Procuring Agricultural Inputs Through Farmer Collectives MR Bhardwaj, B Ahmed, P Diwakar, G Ghalme, Y Narahari 2023 IEEE 19th International Conference on Automation Science and …, 2023 | 1 | 2023 |
Group Fair Clustering Revisited-Notions and Efficient Algorithm. S Gupta, G Ghalme, NC Krishnan, S Jain AAMAS, 2854-2856, 2023 | 1 | 2023 |
Mitigating disparity while maximizing reward: tight anytime guarantee for improving bandits V Patil, V Nair, G Ghalme, A Khan arXiv preprint arXiv:2208.09254, 2022 | 1 | 2022 |
Envy-free cake cutting with graph constraints G Ghalme, X Huang, N Rathi arXiv preprint arXiv:2205.12559, 2022 | 1 | 2022 |
Sleeping Combinatorial Bandits K Abhishek, G Ghalme, S Gujar, Y Narahari arXiv preprint arXiv:2106.01624, 2021 | 1 | 2021 |