default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGanesh Ghalme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Subham Pokhriyal, Shweta Jain, Ganesh Ghalme, Swapnil Dhamal, Sujit Gujar:
Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits. AAMAS 2024: 1576-1584- [c18]Shivam Gupta
, Shweta Jain, Narayanan C. Krishnan, Ganesh Ghalme, Nandyala Hemachandra:
Online Algorithm for Clustering with Capacity Constraints. COMAD/CODS 2024: 572-573 - [c17]Shivam Gupta, Shweta Jain, Narayanan C. Krishnan, Ganesh Ghalme, Nandyala Hemachandra:
Capacitated Online Clustering Algorithm. ECAI 2024: 1880-1887 - [i14]Subham Pokhriyal, Shweta Jain, Ganesh Ghalme, Swapnil Dhamal, Sujit Gujar:
Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits. CoRR abs/2402.05575 (2024) - [i13]Ganesh Ghalme, Reshef Meir:
Condorcet's Jury Theorem with Abstention. CoRR abs/2408.00317 (2024) - 2023
- [j3]Shivam Gupta, Ganesh Ghalme, Narayanan C. Krishnan, Shweta Jain:
Efficient algorithms for fair clustering with a new notion of fairness. Data Min. Knowl. Discov. 37(5): 1959-1997 (2023) - [c16]Shivam Gupta, Ganesh Ghalme, Narayanan C. Krishnan, Shweta Jain:
Group Fair Clustering Revisited - Notions and Efficient Algorithm. AAMAS 2023: 2854-2856 - [c15]Mayank Ratan Bhardwaj, Bazil Ahmed, Prathik Diwakar, Ganesh Ghalme, Y. Narahari:
Designing Fair, Cost-Optimal Auctions Based on Deep Learning for Procuring Agricultural Inputs Through Farmer Collectives. CASE 2023: 1-8 - [c14]Manan Singh, Sai Srinivas Kancheti, Shivam Gupta, Ganesh Ghalme, Shweta Jain, Narayanan C. Krishnan:
Algorithmic Recourse based on User's Feature-order Preference. COMAD/CODS 2023: 293-294 - [c13]Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan:
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. IJCAI 2023: 4100-4108 - [c12]Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi:
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees. WINE 2023: 310-328 - [i12]Mayank Ratan Bhardwaj, Bazil Ahmed, Prathik Diwakar, Ganesh Ghalme, Y. Narahari:
Designing Fair, Cost-optimal Auctions based on Deep Learning for Procuring Agricultural Inputs through Farmer Collectives. CoRR abs/2304.07341 (2023) - 2022
- [c11]Ganesh Ghalme, Vineet Nair, Vishakha Patil, Yilun Zhou:
Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment. AAMAS 2022: 525-533 - [c10]Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Representation. ICML 2022: 16331-16352 - [c9]Shantanu Das, Swapnil Dhamal, Ganesh Ghalme, Shweta Jain, Sujit Gujar:
Individual fairness in feature-based pricing for monopoly markets. UAI 2022: 486-495 - [i11]Shantanu Das, Swapnil Dhamal, Ganesh Ghalme, Shweta Jain, Sujit Gujar:
Individual Fairness in Feature-Based Pricing for Monopoly Markets. CoRR abs/2202.12844 (2022) - [i10]Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Representation. CoRR abs/2206.08542 (2022) - [i9]Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan:
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. CoRR abs/2208.09254 (2022) - [i8]Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi:
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees. CoRR abs/2211.06458 (2022) - 2021
- [j2]Ganesh Ghalme, Swapnil Dhamal, Shweta Jain, Sujit Gujar, Y. Narahari:
Ballooning multi-armed bandits. Artif. Intell. 296: 103485 (2021) - [j1]Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari:
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem. J. Mach. Learn. Res. 22: 174:1-174:31 (2021) - [c8]Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Classification in the Dark. ICML 2021: 3672-3681 - [i7]Ganesh Ghalme, Vineet Nair, Vishakha Patil, Yilun Zhou:
State-Visitation Fairness in Average-Reward MDPs. CoRR abs/2102.07120 (2021) - [i6]Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Classification in the Dark. CoRR abs/2102.11592 (2021) - [i5]Kumar Abhishek, Ganesh Ghalme, Sujit Gujar, Yadati Narahari:
Sleeping Combinatorial Bandits. CoRR abs/2106.01624 (2021) - [i4]Shivam Gupta, Ganesh Ghalme, Narayanan C. Krishnan, Shweta Jain:
Efficient Algorithms For Fair Clustering with a New Fairness Notion. CoRR abs/2109.00708 (2021) - 2020
- [c7]Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari:
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem. AAAI 2020: 5379-5386 - [c6]Ganesh Ghalme, Swapnil Dhamal, Shweta Jain, Sujit Gujar, Y. Narahari:
Ballooning Multi-Armed Bandits. AAMAS 2020: 1849-1851 - [i3]Ganesh Ghalme, Swapnil Dhamal, Shweta Jain, Sujit Gujar, Y. Narahari:
Ballooning Multi-Armed Bandits. CoRR abs/2001.10055 (2020)
2010 – 2019
- 2019
- [c5]Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang:
Fair Division of Indivisible Goods Among Strategic Agents. AAMAS 2019: 1811-1813 - [i2]Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang:
Fair Division of Indivisible Goods Among Strategic Agents. CoRR abs/1901.09427 (2019) - [i1]Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari:
Achieving Fairness in the Stochastic Multi-armed Bandit Problem. CoRR abs/1907.10516 (2019) - 2018
- [c4]Ganesh Ghalme, Sujit Gujar, Amleshwar Kumar, Shweta Jain, Y. Narahari:
Design of Coalition Resistant Credit Score Functions for Online Discussion Forums. AAMAS 2018: 95-103 - 2017
- [c3]Ganesh Ghalme, Shweta Jain, Sujit Gujar, Y. Narahari:
Thompson Sampling Based Mechanisms for Stochastic Multi-Armed Bandit Problems. AAMAS 2017: 87-95 - [c2]Aritra Chatterjee, Ganesh Ghalme, Shweta Jain, Rohit Vaish, Y. Narahari:
Analysis of Thompson Sampling for Stochastic Sleeping Bandits. UAI 2017 - 2016
- [c1]Shweta Jain, Ganesh Ghalme, Satyanath Bhat, Sujit Gujar, Y. Narahari:
A Deterministic MAB Mechanism for Crowdsourcing with Logarithmic Regret and Immediate Payments. AAMAS 2016: 86-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
