arXiv:2412.09321 · v7

Learning to Choose with Categories: Theory and an Application to Algorithmic Prominence

基于类别的学习选择：理论及其在算法突出性中的应用

首次提交 2024-12-12 22:47

版本更新 2026-11-10 02:14

雷达观测 2026-11-10 15:22

摘要

We introduce Coarse Q-learning, a reinforcement learning framework in which a decision-maker partitions alternatives into coarse similarity classes, chooses among available classes using logit, and learns class valuations by averaging experienced payoffs. Even in stationary bandit problems with independently drawn menus, choices change the composition of pooled feedback. By deriving the continuous-time mean field ODE limit, we show this endogenous sampling can generate a unique globally attracting mixed equilibrium with limiting indifference, multiple stable strict rankings, or persistent cycling. Learning can reduce welfare even when the coarse representation admits efficient choice. An application demonstrates how digital platforms may exploit this feedback by promoting high-quality products to sustain purchases of inferior products under a common brand.

作者备注：45 Main pages + 92 Supplemental Appendix pages