Toward Fair Recommendation in Two-sided Platforms

  title={Toward Fair Recommendation in Two-sided Platforms},
  author={Arpita Biswas and Gourab K. Patro and Niloy Ganguly and Krishna P. Gummadi and Abhijnan Chakraborty},
  journal={ACM Transactions on the Web (TWEB)},
  pages={1 - 34}
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. Traditionally, recommendation services in these platforms have focused on maximizing customer satisfaction by tailoring the results according to the personalized preferences of individual customers. However, our investigation reinforces the fact that such customer-centric design of these services may lead to unfair… 

On Achieving Leximin Fairness and Stability in Many-to-One Matchings

The past few years have seen a surge of work on fairness in allocation problems where items must be fairly divided among agents having individual preferences. In comparison, fairness in settings with…

Fairness in Recommendation: A Survey

This survey focuses on the foundations for fairness in recommendation literature with a focus on the taxonomies of current fairness definitions, the typical techniques for improving fairness, as well as the datasets for fairness studies in recommendation.



FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms

The proposed FairRec algorithm guarantees at least Maximin Share of exposure for most of the producers and Envy-Free up to One Good fairness for every customer and extensive evaluations show the effectiveness of FairRec in ensuring two-sided fairness while incurring a marginal loss in the overall recommendation quality.

Incremental Fairness in Two-Sided Market Platforms: On Smoothly Updating Recommendations

Evaluations over multiple real world datasets show that the proposed mechanism for platform updates can be efficient and fair to both the producers and the customers in two-sided platforms.

Multistakeholder recommendation with provider constraints

A constraint-based integer programming optimization model is proposed, in which different sets of constraints are used to reflect the goals of the different stakeholders, so it can easily be added onto an existing recommendation system to make it multi-stakeholder aware.

Fair Sharing for Sharing Economy Platforms

This work takes the first step towards rethinking fairness in online sharing economy systems with an additional emphasis on the well-being of providers, and provides insights into parallels with well-established practical implementations in other domains.

Two-Sided Fairness for Repeated Matchings in Two-Sided Markets: A Case Study of a Ride-Hailing Platform

This paper analyzes job assignments of a major taxi company and observes that there is significant inequality in the driver income distribution, and proposes a novel framework to think about fairness in the matching mechanisms of ride hailing platforms.

Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search

This work presents a framework for quantifying and mitigating algorithmic bias in mechanisms designed for ranking individuals, typically used as part of web-scale search and recommendation systems, and is the first large-scale deployed framework for ensuring fairness in the hiring domain.

The Unreasonable Fairness of Maximum Nash Welfare

It is proved that the maximum Nash welfare solution selects allocations that are envy free up to one good --- a compelling notion that is quite elusive when coupled with economic efficiency.

Groupwise Maximin Fair Allocation of Indivisible Goods

A stronger notion of fairness is defined, called groupwise maximin share guarantee (GMMS), which requires that the maxim in share guarantee is achieved not just with respect to the grand bundle, but also among all the subgroups of agents and provides an ex-post fairness guarantee.

Equity of Attention: Amortizing Individual Fairness in Rankings

The challenge of achieving amortized individual fairness subject to constraints on ranking quality as an online optimization problem is formulated and solved as an integer linear program and it is demonstrated that the method can improve individual fairness while retaining high ranking quality.

Comparing Approximate Relaxations of Envy-Freeness

This work investigates further the connectionsΒ  between the four notions mentioned above and their approximate versions, and establishes several tight or almost tight results concerning the approximation quality that any of these notions guarantees for the others, providing an almost complete picture of this landscape.