9 papers
Fair Stable Matching: A Nash Social Welfare Approach
Parth Desai, Rasheed M, Ganesh Ghalme +1
While traditional stable matching algorithms, such as the Gale-Shapley algorithm, prioritize stability, they may fall short of achieving equitable outcomes among participants. We s…
Resourced Authority A Mechanism-Design Model for Participatory Governance of Deployed AI Agents
Praphul Chandra, Sujit Gujar, Ganesh Ghalme
We give a formal mechanism design model for the continuous participatory governance of a deployed AI agent. The mechanism is built on the principle that governance should control a…
Linear Strategic Classification with Endogenous Improvements
Siddharth Shrivastava, Mahvith Akshintala, B Vamsha Vardhan Reddy +3
Classical models of strategic classification treat agents' responses to a deployed classifier as cosmetic: features change, but true labels do not. We study an improvement-aware va…
Multi-Sender Bayesian Persuasion with Imperfect Information
Andra Siva Sai Teja, Ganesh Ghalme, Sujit Gujar
We study a multi-sender Bayesian persuasion problem with one receiver and several strategic senders. The underlying ground state has multiple components, each privately observed by…
Lipschitz Dueling Bandits over Continuous Action Spaces
Mudit Sharma, Shweta Jain, Vaneet Aggarwal +1
We study for the first time, stochastic dueling bandits over continuous action spaces with Lipschitz structure, where feedback is purely comparative. While dueling bandits and Lips…
On Condorcet's Jury Theorem with Abstention
Reshef Meir, Ganesh Ghalme
The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study…
Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
Piyushi Manupriya, Himanshu, SakethaNath Jagarlapudi +1
We investigate the problem of maximizing social welfare while ensuring fairness in a multi-agent multi-armed bandit (MA-MAB) setting. In this problem, a centralized decision-maker…
Condorcet's Jury Theorem with Abstention
Ganesh Ghalme, Reshef Meir
The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increase…
Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits
Subham Pokhriyal, Shweta Jain, Ganesh Ghalme +2
Existing approaches to fairness in stochastic multi-armed bandits (MAB) primarily focus on exposure guarantee to individual arms. When arms are naturally grouped by certain attribu…