paper-with-me

홈 › Papers

Fairness without Regret

2019-07-11 · Marcus Hutter

A popular approach of achieving fairness in optimization problems is by constraining the solution space to "fair" solutions, which unfortunately typically reduces solution quality. In practice, the ultimate goal is often an aggregate of sub-goals without a unique or best way of combining them or which is otherwise only partially known. I turn this problem into a feature and suggest to use a parametrized objective and vary the parameters within reasonable ranges to get a "set" of optimal solutions, which can then be optimized using secondary criteria such as fairness without compromising the primary objective, i.e. without regret (societal cost).

📄 PDF Abstract BibTeX arXiv:1907.05159

Code (0)

등록된 구현이 없습니다.

Tasks

Fairness

Similar Papers 제목 키워드 기반

Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits

2024-02-08 · Subham Pokhriyal, Shweta Jain, Ganesh Ghalme, Swapnil Dhamal 외

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 attribute(s), we propose Bi-Level Fairness, whi…

AttributeExposure FairnessFairnessMulti-Armed Bandits

Achieving Fairness in Stochastic Multi-armed Bandit Problem

2019-05-27 · Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari

We study an interesting variant of the stochastic multi-armed bandit problem, called the Fair-SMAB problem, where each arm is required to be pulled for at least a given fraction of the total available rounds. We investig…

FairnessMulti-Armed Bandits

Achieving Fairness in the Stochastic Multi-armed Bandit Problem

2019-07-23 · Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari

We study an interesting variant of the stochastic multi-armed bandit problem, called the Fair-SMAB problem, where each arm is required to be pulled for at least a given fraction of the total available rounds. We investig…

Fairness

Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness

2025-02-21 · Piyushi Manupriya, Himanshu, SakethaNath Jagarlapudi, Ganesh Ghalme

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 takes actions over time, generating rand…

FairnessMulti-Armed Bandits

Towards Reducing Biases in Combining Multiple Experts Online

2019-08-19 · Yi Sun, Ivan Ramirez, Alfredo Cuesta-Infante, Kalyan Veeramachaneni

In many real life situations, including job and loan applications, gatekeepers must make justified and fair real-time decisions about a person's fitness for a particular opportunity. In this paper, we aim to accomplish a…

Decision MakingFairness