中文
相关论文

相关论文: Fair Division Without Disparate Impact

200 篇论文

Fairness concerns about algorithmic decision-making systems have been mainly focused on the outputs (e.g., the accuracy of a classifier across individuals or groups). However, one may additionally be concerned with fairness in the inputs.…

机器学习 · 计算机科学 2020-05-26 Bashir Rastegarpanah , Mark Crovella , Krishna P. Gummadi

Allocating multiple scarce items across a set of individuals is an important practical problem. In the case of divisible goods and additive preferences a convex program can be used to find the solution that maximizes Nash welfare (MNW). The…

计算机科学与博弈论 · 计算机科学 2019-09-25 Christian Kroer , Alexander Peysakhovich

What does it mean for an algorithm to be biased? In U.S. law, unintentional bias is encoded via disparate impact, which occurs when a selection process has widely different outcomes for different groups, even as it appears to be neutral.…

The field of fair machine learning aims to ensure that decisions guided by algorithms are equitable. Over the last decade, several formal, mathematical definitions of fairness have gained prominence. Here we first assemble and categorize…

计算机与社会 · 计算机科学 2023-08-31 Sam Corbett-Davies , Johann D. Gaebler , Hamed Nilforoshan , Ravi Shroff , Sharad Goel

We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distribution over the projects. The main purpose of our study concerns…

计算机科学与博弈论 · 计算机科学 2020-11-02 Zhongzheng Tang , Chenhao Wang , Mengqi Zhang

We study the fair allocation problem of indivisible items with subsidy. In this paper, we focus on the notion of fairness - equitability (EQ), which requires that items be allocated such that all agents value the bundle they receive…

计算机科学与博弈论 · 计算机科学 2025-09-10 Yuanyuan Wang , Tianze Wei

The fair division literature in economics considers how to divide resources between multiple agents such that the allocation is envy-free: each agent receives their favorite piece. Researchers have developed a variety of fair division…

编程语言 · 计算机科学 2023-04-11 Noah Bertram , Alex Levinson , Justin Hsu

Clustering algorithms may unintentionally propagate or intensify existing disparities, leading to unfair representations or biased decision-making. Current fair clustering methods rely on notions of fairness that do not capture any…

机器学习 · 统计学 2023-12-15 Fritz Bayer , Drago Plecko , Niko Beerenwinkel , Jack Kuipers

Algorithmic fairness has gained prominence due to societal and regulatory concerns about biases in Machine Learning models. Common group fairness metrics like Equalized Odds for classification or Demographic Parity for both classification…

机器学习 · 统计学 2023-11-01 François HU , Philipp Ratz , Arthur Charpentier

We formulate the problem of fair and efficient completion of indivisible goods, defined as follows: Given a partial allocation of indivisible goods among agents, does there exist an allocation of the remaining goods (i.e., a completion)…

计算机科学与博弈论 · 计算机科学 2024-12-30 Vishwa Prakash HV , Ayumi Igarashi , Rohit Vaish

Common fairness definitions in machine learning focus on balancing notions of disparity and utility. In this work, we study fairness in the context of risk disparity among sub-populations. We are interested in learning models that minimize…

机器学习 · 计算机科学 2019-11-19 Natalia Martinez , Martin Bertran , Guillermo Sapiro

In this article we study a cake cutting problem. More precisely, we study symmetric fair division algorithms, that is to say we study algorithms where the order of the players do not influence the value obtained by each player. In the first…

计算机科学与博弈论 · 计算机科学 2019-10-14 Guillaume Chèze

Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \textit{equitability up to one item} (EQ1) and focus on the…

计算机科学与博弈论 · 计算机科学 2025-08-22 Hadi Hosseini , Aditi Sethia

We study the fair allocation of indivisible items under relevance constraints, where each agent has a set of relevant items and can only receive items that are relevant to them. While the relevance constraint has been studied in recent…

计算机科学与博弈论 · 计算机科学 2026-03-19 Ankang Sun , Ruijie Wang , Bo Li

Rankings of people and items are at the heart of selection-making, match-making, and recommender systems, ranging from employment sites to sharing economy platforms. As ranking positions influence the amount of attention the ranked subjects…

信息检索 · 计算机科学 2018-05-07 Asia J. Biega , Krishna P. Gummadi , Gerhard Weikum

The problem of allocating indivisible resources to agents arises in a wide range of domains, including treatment distribution and social support programs. An important goal in algorithm design for this problem is fairness, where the focus…

计算机科学与博弈论 · 计算机科学 2026-02-17 Niclas Boehmer , Luca Kreisel

We study the problem of fairly dividing a heterogeneous resource, commonly known as cake cutting and chore division, in the presence of strategic agents. While a number of results in this setting have been established in previous works,…

计算机科学与博弈论 · 计算机科学 2020-09-15 Xiaohui Bei , Guangda Huzhang , Warut Suksompong

We study classic fair-division problems in a partial information setting. This paper respectively addresses fair division of rent, cake, and indivisible goods among agents with cardinal preferences. We will show that, for all of these…

计算机科学与博弈论 · 计算机科学 2018-11-28 Eshwar Ram Arunachaleswaran , Siddharth Barman , Nidhi Rathi

Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study…

Machine learning actively impacts our everyday life in almost all endeavors and domains such as healthcare, finance, and energy. As our dependence on the machine learning increases, it is inevitable that these algorithms will be used to…

机器学习 · 计算机科学 2021-02-23 Ankit Kulshrestha , Ilya Safro