A General Framework for Fairness in Multistakeholder Recommendations
- URL: http://arxiv.org/abs/2009.02423v1
- Date: Fri, 4 Sep 2020 23:54:06 GMT
- Title: A General Framework for Fairness in Multistakeholder Recommendations
- Authors: Harshal A. Chaudhari, Sangdi Lin, Ondrej Linda
- Abstract summary: We propose a general formulation that incorporates seller coverage objectives alongside individual buyer objectives in a real-time personalized recommender system.
We leverage highly scalable submodular optimization algorithms to provide recommendations to each buyer with provable theoretical quality bounds.
- Score: 1.503974529275767
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Contemporary recommender systems act as intermediaries on multi-sided
platforms serving high utility recommendations from sellers to buyers. Such
systems attempt to balance the objectives of multiple stakeholders including
sellers, buyers, and the platform itself. The difficulty in providing
recommendations that maximize the utility for a buyer, while simultaneously
representing all the sellers on the platform has lead to many interesting
research problems.Traditionally, they have been formulated as integer linear
programs which compute recommendations for all the buyers together in an
\emph{offline} fashion, by incorporating coverage constraints so that the
individual sellers are proportionally represented across all the recommended
items. Such approaches can lead to unforeseen biases wherein certain buyers
consistently receive low utility recommendations in order to meet the global
seller coverage constraints. To remedy this situation, we propose a general
formulation that incorporates seller coverage objectives alongside individual
buyer objectives in a real-time personalized recommender system. In addition,
we leverage highly scalable submodular optimization algorithms to provide
recommendations to each buyer with provable theoretical quality bounds.
Furthermore, we empirically evaluate the efficacy of our approach using data
from an online real-estate marketplace.
Related papers
- Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs.
Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
arXiv Detail & Related papers (2024-11-20T18:06:55Z) - Learning Recommender Systems with Soft Target: A Decoupled Perspective [49.83787742587449]
We propose a novel decoupled soft label optimization framework to consider the objectives as two aspects by leveraging soft labels.
We present a sensible soft-label generation algorithm that models a label propagation algorithm to explore users' latent interests in unobserved feedback via neighbors.
arXiv Detail & Related papers (2024-10-09T04:20:15Z) - Fair Allocation in Dynamic Mechanism Design [57.66441610380448]
We consider a problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds.
The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group.
arXiv Detail & Related papers (2024-05-31T19:26:05Z) - Algorithmic Collusion or Competition: the Role of Platforms' Recommender
Systems [2.551933457838182]
This study examines how recommendation algorithms can determine the competitive or collusive dynamics of AI-based pricing algorithms.
Experimental results reveal that a profit-based recommender system intensifies algorithmic collusion among sellers due to its congruence with sellers' profit-maximizing objectives.
A demand-based recommender system fosters price competition among sellers and results in a lower price, owing to its misalignment with sellers' goals.
arXiv Detail & Related papers (2023-09-25T21:45:30Z) - Interpolating Item and User Fairness in Multi-Sided Recommendations [13.635310806431198]
We introduce a novel fair recommendation framework, Problem (FAIR)
We propose a low-regret algorithm FORM that concurrently performs real-time learning and fair recommendations, two tasks that are often at odds.
We demonstrate the efficacy of our framework and method in maintaining platform revenue while ensuring desired levels of fairness for both items and users.
arXiv Detail & Related papers (2023-06-12T15:00:58Z) - Incentive-Aware Recommender Systems in Two-Sided Markets [49.692453629365204]
We propose a novel recommender system that aligns with agents' incentives while achieving myopically optimal performance.
Our framework models this incentive-aware system as a multi-agent bandit problem in two-sided markets.
Both algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation.
arXiv Detail & Related papers (2022-11-23T22:20:12Z) - PipAttack: Poisoning Federated Recommender Systems forManipulating Item
Promotion [58.870444954499014]
A common practice is to subsume recommender systems under the decentralized federated learning paradigm.
We present a systematic approach to backdooring federated recommender systems for targeted item promotion.
arXiv Detail & Related papers (2021-10-21T06:48:35Z) - A Graph-based Approach for Mitigating Multi-sided Exposure Bias in
Recommender Systems [7.3129791870997085]
We introduce FairMatch, a graph-based algorithm that improves exposure fairness for items and suppliers.
A comprehensive set of experiments on two datasets and comparison with state-of-the-art baselines show that FairMatch, while significantly improves exposure fairness and aggregate diversity, maintains an acceptable level of relevance of the recommendations.
arXiv Detail & Related papers (2021-07-07T18:01:26Z) - Learnable Strategies for Bilateral Agent Negotiation over Multiple
Issues [6.12762193927784]
We present a novel bilateral negotiation model that allows a self-interested agent to learn how to negotiate over multiple issues.
The model relies upon interpretable strategy templates representing the tactics the agent should employ during the negotiation.
It learns template parameters to maximize the average utility received over multiple negotiations, thus resulting in optimal bid acceptance and generation.
arXiv Detail & Related papers (2020-09-17T13:52:18Z) - SetRank: A Setwise Bayesian Approach for Collaborative Ranking from
Implicit Feedback [50.13745601531148]
We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system.
Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons.
We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
arXiv Detail & Related papers (2020-02-23T06:40:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.