How Bad is Top-K Recommendation under Competing Content Creators?

Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, Haifeng Xu
2/3/2023
cs.GTcs.CYcs.IR

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Content creators compete for exposure on recommendation platforms, and such strategic behavior leads to a dynamic shift over the content distribution. However, how the creators' competition impacts user welfare and how the relevance-driven recommendation influences the dynamics in the long run are still largely unknown. This work provides theoretical insights into these research questions. We model the creators' competition under the assumptions that: 1) the platform employs an innocuous top-$K$ recommendation policy; 2) user decisions follow the Random Utility model; 3) content creators compete for user engagement and, without knowing their utility function in hindsight, apply arbitrary no-regret learning algorithms to update their strategies. We study the user welfare guarantee through the lens of Price of Anarchy and show that the fraction of user welfare loss due to creator competition is always upper bounded by a small constant depending on $K$ and randomness in user decisions; we also prove the tightness of this bound. Our result discloses an intrinsic merit of the myopic approach to the recommendation, i.e., relevance-driven matching performs reasonably well in the long run, as long as users' decisions involve randomness and the platform provides reasonably many alternatives to its users.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yao2023topk,
  title  = {How Bad is Top-K Recommendation under Competing Content Creators?},
  author = {Fan Yao and Chuanhao Li and Denis Nekipelov and Hongning Wang and Haifeng Xu},
  year   = {2023},
  eprint = {2302.01971},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.01971v2},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.01971.svg)](https://codeofpaper.com/paper/2302.01971)

Discussion