Achieving fairness in the stochastic multi-armed bandit problem V Patil, G Ghalme, V Nair, Y Narahari The Journal of Machine Learning Research 22 (1), 7885-7915, 2021 | 100 | 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 | 31 | 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 | 28 | 2019 |
Analysis of Thompson Sampling for Stochastic Sleeping Bandits. A Chatterjee, G Ghalme, S Jain, R Vaish, Y Narahari UAI, 2017 | 18 | 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 | 16 | 2016 |
Thompson sampling based mechanisms for stochastic multi-armed bandit problems G Ghalme, S Jain, S Gujar, Y Narahari Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017 | 11 | 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 | 7 | 2016 |
Ballooning multi-armed bandits G Ghalme, S Dhamal, S Jain, S Gujar, Y Narahari Artificial Intelligence 296, 103485, 2021 | 4 | 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 | 4 | 2018 |
Strategic representation V Nair, G Ghalme, I Talgam-Cohen, N Rosenfeld International Conference on Machine Learning, 16331-16352, 2022 | 3 | 2022 |
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 | 3 | 2021 |
State-Visitation Fairness in Average-Reward MDPs G Ghalme, V Nair, V Patil, Y Zhou arXiv preprint arXiv:2102.07120, 2021 | 2 | 2021 |
Efficient algorithms for fair clustering with a new notion of fairness S Gupta, G Ghalme, NC Krishnan, S Jain Data Mining and Knowledge Discovery, 1-39, 2023 | 1 | 2023 |
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees G Ghalme, X Huang, Y Machino, N Rathi arXiv preprint arXiv:2211.06458, 2022 | 1 | 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 | 1 | 2022 |
Envy-free cake cutting with graph constraints G Ghalme, X Huang, N Rathi arXiv preprint arXiv:2205.12559, 2022 | 1 | 2022 |
Efficient Algorithms For Fair Clustering with a New Fairness Notion S Gupta, G Ghalme, NC Krishnan, S Jain arXiv preprint arXiv:2109.00708, 2021 | 1 | 2021 |
Sleeping Combinatorial Bandits K Abhishek, G Ghalme, S Gujar, Y Narahari arXiv preprint arXiv:2106.01624, 2021 | 1 | 2021 |
Group Fair Clustering Revisited--Notions and Efficient Algorithm S Gupta, G Ghalme, NC Krishnan, S Jain Proceedings of the 2023 International Conference on Autonomous Agents and …, 2023 | | 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 arXiv preprint arXiv:2304.07341, 2023 | | 2023 |