Fairness in Network-Friendly Recommendations
Theodoros Giannakas, Pavlos Sermpezis, Anastasios Giovanidis,, Thrasyvoulos Spyropoulos, George Arvanitakis

TL;DR
This paper investigates the fairness issues in network-friendly recommendations (NFR), highlighting the unfairness caused by existing schemes and proposing a linear optimization-based method to balance network performance with fairness guarantees.
Contribution
It is the first study to analyze fairness in NFR, quantify the unfairness, and develop a fair-NFR framework using linear optimization to improve fairness without sacrificing network gains.
Findings
NFR can cause significant unfairness among content providers.
There is an inherent trade-off between network gains and fairness in NFR.
Fair-NFR achieves high network performance with minimal unfairness.
Abstract
As mobile traffic is dominated by content services (e.g., video), which typically use recommendation systems, the paradigm of network-friendly recommendations (NFR) has been proposed recently to boost the network performance by promoting content that can be efficiently delivered (e.g., cached at the edge). NFR increase the network performance, however, at the cost of being unfair towards certain contents when compared to the standard recommendations. This unfairness is a side effect of NFR that has not been studied in literature. Nevertheless, retaining fairness among contents is a key operational requirement for content providers. This paper is the first to study the fairness in NFR, and design fair-NFR. Specifically, we use a set of metrics that capture different notions of fairness, and study the unfairness created by existing NFR schemes. Our analysis reveals that NFR can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
