Ganesh Ghalme

Orcid: 0000-0001-5049-4764

According to our database1, Ganesh Ghalme authored at least 22 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits.
CoRR, 2024

Online Algorithm for Clustering with Capacity Constraints.
Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD), 2024

2023
Efficient algorithms for fair clustering with a new notion of fairness.
Data Min. Knowl. Discov., September, 2023

A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Algorithmic Recourse based on User's Feature-order Preference.
Proceedings of the 6th Joint International Conference on Data Science & Management of Data (10th ACM IKDD CODS and 28th COMAD), 2023

Designing Fair, Cost-Optimal Auctions Based on Deep Learning for Procuring Agricultural Inputs Through Farmer Collectives.
Proceedings of the 19th IEEE International Conference on Automation Science and Engineering, 2023

Group Fair Clustering Revisited - Notions and Efficient Algorithm.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Individual fairness in feature-based pricing for monopoly markets.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Strategic Representation.
Proceedings of the International Conference on Machine Learning, 2022

Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem.
J. Mach. Learn. Res., 2021

Efficient Algorithms For Fair Clustering with a New Fairness Notion.
CoRR, 2021

Sleeping Combinatorial Bandits.
CoRR, 2021

State-Visitation Fairness in Average-Reward MDPs.
CoRR, 2021

Ballooning multi-armed bandits.
Artif. Intell., 2021

Strategic Classification in the Dark.
Proceedings of the 38th International Conference on Machine Learning, 2021

2019
Fair Division of Indivisible Goods Among Strategic Agents.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Design of Coalition Resistant Credit Score Functions for Online Discussion Forums.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Analysis of Thompson Sampling for Stochastic Sleeping Bandits.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Thompson Sampling Based Mechanisms for Stochastic Multi-Armed Bandit Problems.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
A Deterministic MAB Mechanism for Crowdsourcing with Logarithmic Regret and Immediate Payments.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016


  Loading...