Pith. sign in

REVIEW 1 cited by

CPFair: Personalized Consumer and Producer Fairness Re-ranking for Recommender Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.08085 v1 pith:LINELUEN submitted 2022-04-17 cs.IR cs.AI

classification cs.IRcs.AI
keywords fairnesssystemsrecommenderconsumeralgorithmsproducerre-rankingtreat
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, there has been a rising awareness that when machine learning (ML) algorithms are used to automate choices, they may treat/affect individuals unfairly, with legal, ethical, or economic consequences. Recommender systems are prominent examples of such ML systems that assist users in making high-stakes judgments. A common trend in the previous literature research on fairness in recommender systems is that the majority of works treat user and item fairness concerns separately, ignoring the fact that recommender systems operate in a two-sided marketplace. In this work, we present an optimization-based re-ranking approach that seamlessly integrates fairness constraints from both the consumer and producer-side in a joint objective framework. We demonstrate through large-scale experiments on 8 datasets that our proposed method is capable of improving both consumer and producer fairness without reducing overall recommendation quality, demonstrating the role algorithms may play in minimizing data biases.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation

    cs.IR 2025-02 reject novelty 5.0 of 10

    A dual-optimization method for group max-min fairness in recommender systems is proposed to reduce the mini-batch Jensen gap, but the central convergence theorem is internally inconsistent.

Pith tools