Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approach (2008.00104v2)

Published 31 Jul 2020 in cs.LG, cs.AI, cs.IR, and stat.ML

Abstract: Most recommender systems (RS) research assumes that a user's utility can be maximized independently of the utility of the other agents (e.g., other users, content providers). In realistic settings, this is often not true---the dynamics of an RS ecosystem couple the long-term utility of all agents. In this work, we explore settings in which content providers cannot remain viable unless they receive a certain level of user engagement. We formulate the recommendation problem in this setting as one of equilibrium selection in the induced dynamical system, and show that it can be solved as an optimal constrained matching problem. Our model ensures the system reaches an equilibrium with maximal social welfare supported by a sufficiently diverse set of viable providers. We demonstrate that even in a simple, stylized dynamical RS model, the standard myopic approach to recommendation---always matching a user to the best provider---performs poorly. We develop several scalable techniques to solve the matching problem, and also draw connections to various notions of user regret and fairness, arguing that these outcomes are fairer in a utilitarian sense.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Martin Mladenov (22 papers)
  2. Elliot Creager (21 papers)
  3. Omer Ben-Porat (27 papers)
  4. Kevin Swersky (51 papers)
  5. Richard Zemel (82 papers)
  6. Craig Boutilier (78 papers)
Citations (60)