论文标题
双面市场的激励意识推荐系统
Incentive-Aware Recommender Systems in Two-Sided Markets
论文作者
论文摘要
互联网经济中的在线平台通常包含推荐系统,向用户(或“代理”)推荐产品(或“武器”)。该领域的一个主要挑战来自近视药物,他们自然会通过基于当前信息选择最佳臂,而不是探索各种替代方案来收集受益于集体的信息。我们提出了一个新颖的推荐系统,该系统与代理的激励措施一致,同时实现渐近性最佳性能,这是通过重复互动中的遗憾来衡量的。我们的框架将这种激励感的系统建模为在双面市场中的多代理匪徒问题,在线平台上的推荐系统可以促进代理和武器的相互作用。该模型结合了代理商机会成本引起的激励限制。在平台已知机会成本的情况下,我们显示了与激励兼容的建议算法的存在。该算法通过随机和适应性策略在真正的好手臂和未知的手臂之间提出建议。此外,当这些机会成本尚不清楚时,我们引入了一种算法,该算法利用每个ARM的累积损失作为战略探索的反馈,将所有武器的建议随机汇总建议。我们证明,这两种算法都满足了前柱公平标准,该标准可以保护代理免受过度开发。使用建议的算法和复制结果的所有代码都在GitHub上提供。
Online platforms in the Internet Economy commonly incorporate recommender systems that recommend products (or "arms") to users (or "agents"). A key challenge in this domain arises from myopic agents who are naturally incentivized to exploit by choosing the optimal arm based on current information, rather than exploring various alternatives to gather information that benefits the collective. We propose a novel recommender system that aligns with agents' incentives while achieving asymptotically optimal performance, as measured by regret in repeated interactions. Our framework models this incentive-aware system as a multi-agent bandit problem in two-sided markets, where the interactions of agents and arms are facilitated by recommender systems on online platforms. This model incorporates incentive constraints induced by agents' opportunity costs. In scenarios where opportunity costs are known to the platform, we show the existence of an incentive-compatible recommendation algorithm. This algorithm pools recommendations between a genuinely good arm and an unknown arm using a randomized and adaptive strategy. Moreover, when these opportunity costs are unknown, we introduce an algorithm that randomly pools recommendations across all arms, utilizing the cumulative loss from each arm as feedback for strategic exploration. We demonstrate that both algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation. All code for using the proposed algorithms and reproducing results is made available on GitHub.