Fairrec: Two-sided fairness for personalized recommendations in two-sided platforms
We investigate the problem of fair recommendation in the context of two-sided online
platforms, comprising customers on one side and producers on the other. Traditionally …
platforms, comprising customers on one side and producers on the other. Traditionally …
Constraints in fair division
W Suksompong - ACM SIGecom Exchanges, 2021 - dl.acm.org
The fair allocation of resources to interested agents is a fundamental problem in society.
While the majority of the fair division literature assumes that all allocations are feasible, in …
While the majority of the fair division literature assumes that all allocations are feasible, in …
Fair allocation of indivisible goods and chores
We consider the problem of fairly dividing a set of indivisible items. Much of the fair division
literature assumes that the items are “goods” that yield positive utility for the agents. There is …
literature assumes that the items are “goods” that yield positive utility for the agents. There is …
A little charity guarantees almost envy-freeness
BR Chaudhury, T Kavitha, K Mehlhorn… - SIAM Journal on …, 2021 - SIAM
The fair division of indivisible goods is a very well-studied problem. The goal of this problem
is to distribute m goods to n agents in a “fair” manner, where every agent has a valuation for …
is to distribute m goods to n agents in a “fair” manner, where every agent has a valuation for …
Weighted envy-freeness in indivisible item allocation
We introduce and analyze new envy-based fairness concepts for agents with weights that
quantify their entitlements in the allocation of indivisible items. We propose two variants of …
quantify their entitlements in the allocation of indivisible items. We propose two variants of …
Toward fair recommendation in two-sided platforms
Many online platforms today (such as Amazon, Netflix, Spotify, LinkedIn, and AirBnB) can be
thought of as two-sided markets with producers and customers of goods and services …
thought of as two-sided markets with producers and customers of goods and services …
Pareto-optimal allocation of indivisible goods with connectivity constraints
A Igarashi, D Peters - Proceedings of the AAAI conference on artificial …, 2019 - aaai.org
We study the problem of allocating indivisible items to agents with additive valuations, under
the additional constraint that bundles must be connected in an underlying item graph …
the additional constraint that bundles must be connected in an underlying item graph …
Extension of additive valuations to general valuations on the existence of EFX
R Mahara - Mathematics of Operations Research, 2024 - pubsonline.informs.org
Envy freeness is one of the most widely studied notions in fair division. Because envy-free
allocations do not always exist when items are indivisible, several relaxations have been …
allocations do not always exist when items are indivisible, several relaxations have been …
Almost envy-freeness in group resource allocation
M Kyropoulou, W Suksompong… - Theoretical Computer …, 2020 - Elsevier
We study the problem of fairly allocating indivisible goods between groups of agents using
the recently introduced relaxations of envy-freeness. We consider the existence of fair …
the recently introduced relaxations of envy-freeness. We consider the existence of fair …
How to cut a discrete cake fairly
A Igarashi - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
Cake-cutting is a fundamental model of dividing a heterogeneous resource, such as land,
broadcast time, and advertisement space. In this study, we consider the problem of dividing …
broadcast time, and advertisement space. In this study, we consider the problem of dividing …