Fairness in Network-Friendly Recommendations

@article{Giannakas2021FairnessIN,
  title={Fairness in Network-Friendly Recommendations},
  author={Theodoros Giannakas and Pavlos Sermpezis and Anastasios Giovanidis and Thrasyvoulos Spyropoulos and George Arvanitakis},
  journal={2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)},
  year={2021},
  pages={71-80}
}
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… 

Figures and Tables from this paper

Optimal Content Caching and Recommendation with Age of Information
TLDR
This work addresses, optimal scheduling of cache updates for a time-slotted system accounting for content recommendation and AoI, and derives an integer linear formulation, by which the optimal solution can be obtained for small-scale scenarios.
A Survey of Research on Fair Recommender Systems
TLDR
It is found that in many research works in computer science very abstract problem operationalizations are prevalent, which circumvent the fundamental and important question of what represents a fair recommendation in the context of a given application.

References

SHOWING 1-10 OF 45 REFERENCES
SOBA: Session optimal MDP-based network friendly recommendations
TLDR
This work focuses on the problem of optimal policy design for Network Friendly Recommendations (NFR), and proposes a Markov Decision Process (MDP) formulation, which outperforms myopic algorithms both in session cost as well as in offered recommendation quality.
Network-Aware Recommendations in the Wild: Methodology, Realistic Evaluations, Experiments
TLDR
This paper proposes a methodology that enables to evaluate joint network and recommendation schemes in real content services by only using publicly available information, and applies it to the YouTube service, providing experimental evidence for the feasibility and benefits of this paradigm.
The Order of Things: Position-Aware Network-friendly Recommendations in Long Viewing Sessions
TLDR
A stochastic model is proposed that incorporates position-aware recommendations into a Markovian traversal model of the content catalog, and the average cost of a user session is derived using absorbing Markov chain theory.
CABaRet: Leveraging Recommendation Systems for Mobile Edge Caching
TLDR
The results show that significant caching gains can be achieved in practice; 8 to 10 times increase in the cache hit ratio from cache-aware recommendations, and an extra 2 times increase from caching optimization.
Show me the Cache: Optimizing Cache-Friendly Recommendations for Sequential Content Access
TLDR
This paper proposes a Markovian model for recommendation-driven user requests, formulates the problem of biasing the recommendation algorithm to minimize access cost, while maintaining acceptable recommendation quality, and proposes an iterative ADMM-based algorithm that outperforms existing schemes, and shows significant potential for performance improvement on real content datasets.
Jointly Optimizing Content Caching and Recommendations in Small Cell Networks
TLDR
A simpler heuristic algorithm is introduced that essentially serves as a form of lightweight control over recommendations so that they are both appealing to end-users and friendly to network resources.
Joint User Association, Content Caching and Recommendations in Wireless Edge Networks
TLDR
This paper establishes a framework for the joint user association, content caching and recommendations problem, and proposes a heuristic that tackles the joint problem when the objective is to maximize the total hit ratio over all caches.
Personalizing Fairness-aware Re-ranking
TLDR
A Fairness-Aware Re-ranking algorithm (FAR) is proposed to balance the ranking quality and provider-side fairness and can significantly promote fairness with a slight sacrifice in accuracy and can do so while being attentive to individual user differences.
Caching-aware recommendations: Nudging user preferences towards better caching performance
TLDR
This paper approaches recommender systems as network traffic engineering tools that can actively shape content demand towards optimizing user- and network-centric performance objectives and formulate the resulting joint theoretical optimization problem of deciding on the cached content and the recommendations to each user.
Approximation Guarantees for the Joint Optimization of Caching and Recommendation
TLDR
This paper tackles the problem of optimally making caching and recommendation decisions jointly, in the context of the recently introduced “soft cache hits” setup, and shows that even the simplest problem is NP-hard, but that the most generic problem (multiple users, femtocaching network) is approximable to a constant.
...
...