Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Modeling Recommender Ecosystems: Research Challenges at the Intersection of Mechanism Design, Reinforcement Learning and Generative Models (2309.06375v2)

Published 8 Sep 2023 in cs.AI, cs.GT, cs.HC, cs.IR, cs.LG, and cs.MA

Abstract: Modern recommender systems lie at the heart of complex ecosystems that couple the behavior of users, content providers, advertisers, and other actors. Despite this, the focus of the majority of recommender research -- and most practical recommenders of any import -- is on the local, myopic optimization of the recommendations made to individual users. This comes at a significant cost to the long-term utility that recommenders could generate for its users. We argue that explicitly modeling the incentives and behaviors of all actors in the system -- and the interactions among them induced by the recommender's policy -- is strictly necessary if one is to maximize the value the system brings to these actors and improve overall ecosystem "health". Doing so requires: optimization over long horizons using techniques such as reinforcement learning; making inevitable tradeoffs in the utility that can be generated for different actors using the methods of social choice; reducing information asymmetry, while accounting for incentives and strategic behavior, using the tools of mechanism design; better modeling of both user and item-provider behaviors by incorporating notions from behavioral economics and psychology; and exploiting recent advances in generative and foundation models to make these mechanisms interpretable and actionable. We propose a conceptual framework that encompasses these elements, and articulate a number of research challenges that emerge at the intersection of these different disciplines.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (162)
  1. Abdollahpouri, H. 2019. Popularity Bias in Ranking and Recommendation. In Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 529–530.
  2. Multistakeholder Recommendation: Survey and Research Directions. User Modeling and User-Adapted Interaction, 30(1): 127–158.
  3. The Unfairness of Popularity Bias in Recommendation. ArXiv:1907.13286.
  4. Opinion Dynamics with Varying Susceptibility to Persuasion. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD-18), 1089–1098. London.
  5. Long-term Dynamics of Fairness Intervention in Connection Recommender Systems. In Proceedings of the Fifth AAAI/ACM Conference on AI, Ethics, and Society (AIES-22), 22–35. Oxford, UK.
  6. Polar Opinion Dynamics in Social Networks. IEEE Transactions on Automatic Control, 62(11): 5650–5665.
  7. Deconstructing the Filter Bubble: User Decision-making and Recommender Systems. In Proceedings of the 14th ACM Conference on Recommender Systems (RecSys20), 82–91.
  8. Approximation Schemes for Euclidean k-medians and Related Problems. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC-98), 106–113.
  9. Arrow, K. J. 1950. A Difficulty in the Concept of Social Welfare. Journal of Political Economy, 58: 328–346.
  10. Designing Fair Ranking Schemes. In Proceedings of the 2019 International Conference on Management Of Data (SIGMOD-19), 1259–1276. Amsterdam.
  11. An Efficient Dynamic Mechanism. Econometrica, 81(6): 2463–2485.
  12. Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning, 47: 235–256.
  13. Mechanism Design via Machine Learning. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS-05), 605–614.
  14. Multiagent Mechanism Design Without Money. Operations Research, 67(5): 1417–1436.
  15. Fairness and Machine Learning: Limitations and Opportunities. Cambridge, MA: MIT Press.
  16. A Framework for Fairness in Two-Sided Marketplaces. ArXiv:2006.12756.
  17. Modeling Attrition in Recommender Systems with Departing Bandits. In Proceedings of the Thirty-sixth AAAI Conference on Artificial Intelligence (AAAI-22), 6072–6079. Vancouver.
  18. From Recommendation Systems to Facility Location Games. In Proceedings of the Thirty-third AAAI Conference on Artificial Intelligence (AAAI-19), 1772–1779. Honolulu.
  19. A Game-Theoretic Approach to Recommendation Systems with Strategic Content Providers. In Advances in Neural Information Processing Systems 31 (NeurIPS-18), 1118–1128. Montreal.
  20. The Dynamic Pivot Mechanism. Econometrica, 78(2): 771–789.
  21. Dynamic Mechanism Design: An Introduction. Journal of Economic Literature, 57(2): 235–274.
  22. iMLCA: Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding. In Proceedings of the Twenty-second ACM Conference on Economics and Computation (EC’21), 136–136.
  23. Equity of Attention: Amortizing Individual Fairness in Rankings. In 41st International ACM Conference on Research & Development in Information Retrieval (SIGIR-18), 405–414. Ann Arbor, MI.
  24. Preference Elicitation and Query Learning. Journal of Machine Learning Research, 5: 649–667.
  25. Boutilier, C. 2002. A POMDP Formulation of Preference Elicitation Problems. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), 239–246. Edmonton.
  26. Boutilier, C. 2013. Computational Decision Support: Regret-based Models for Optimization and Preference Elicitation. In Crowley, P. H.; and Zentall, T. R., eds., Comparative Decision Making: Analysis and Support Across Disciplines and Applications, 423–453. Oxford: Oxford University Press.
  27. Constraint-based Optimization and Utility Elicitation using the Minimax Decision Criterion. Artifical Intelligence, 170(8–9): 686–713.
  28. Burke, R. 2002. Interactive Critiquing for Catalog Navigation in E-Commerce. Artificial Intelligence Review, 18(3–4): 245–267.
  29. Multi-Agent Reinforcement Learning: An Overview. IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews, 38(2): 156–172.
  30. Advances in Behavioral Economics. Princeton, New Jersey: Princeton University Press.
  31. Privacy-Preserving Recommender Systems with Synthetic Query Generation using Differentially Private Large Language Models. ArXiv:2305.05973.
  32. Statistical Discrimination in Stable Matchings. In Proceedings of the Twenty-third ACM Conference on Economics and Computation (EC’22), 373–374. Boulder, CO.
  33. Fair Personalization. ArXiv:1707.02260.
  34. Celma, Ò. 2010. The Long Tail in Recommender Systems. In Music Recommendation and Discovery, 87–107. Springer.
  35. A Game-Theoretic Perspective on Trust in Recommendation. In ICML Workshop on Responsible Decision-Making in Dynamic Environments.
  36. Experimental Methods: Eliciting Risk Preferences. Journal of Economic Behavior and Organization, 87: 43–51.
  37. Critiquing-based Recommenders: Survey and Emerging Trends. User Modeling and User-Adapted Interaction, 22(1): 125–150.
  38. Top-K Off-Policy Correction for a REINFORCE Recommender System. In 12th ACM International Conference on Web Search and Data Mining (WSDM-19), 456–464. Melbourne, Australia.
  39. Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates. In Proceedings of the Thirty-eighth International Conference on Machine Learning (ICML-21), 1877–1887.
  40. Reinforcement Learning-based Recommender System using Biclustering Technique. ArXiv:1801.05532.
  41. Risk-constrained Reinforcement Learning with Percentile Risk Criteria. Journal of Machine Learning Research, 18(1): 6070–6120.
  42. Learning to Interact with Users: A Collaborative-Bandit Approach. In Proceedings of the 2018 SIAM International Conference on Data Mining (ICDM-18), 612–620. San Diego.
  43. Towards Conversational Recommender Systems. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-16), 815–824. San Francisco.
  44. Deep Neural Networks for YouTube Recommendations. In Proceedings of the 10th ACM Conference on Recommender Systems, 191–198. Boston.
  45. Combinatorial Auctions. Cambridge: MIT Press.
  46. Automated Design of Affine Maximizer Mechanisms In Dynamic Settings. In Sixteenth European Workshop on Reinforcement Learning (EWRL-23). Brussels.
  47. Computational Advertising: Techniques for Targeting Relevant Ads. Foundations and Trends in Information Retrieval, 8(4–5): 263–418.
  48. DeGroot, M. H. 1974. Reaching a Consensus. Journal of the American Statistical Association, 69(345): 118–121.
  49. Incentive Compatible Regression Learning. Journal of Computer and System Sciences, 76(8): 759–777.
  50. BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805.
  51. Fairness through Awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS-12), 214–226. Association for Computing Machinery.
  52. Fairness in Recommender Systems. In Recommender Systems Handbook, 679–707. Springer.
  53. Intertemporal Choice. In Bernheim, B. D.; DellaVigna, S.; and Laibson, D., eds., Handbook of Behavioral Economics: Applications and Foundations, volume 2, chapter 1, 1–67. Elsevier.
  54. Taming Transformers for High-resolution Image Synthesis. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR-21), 12873–12883.
  55. Differentially Private Recommender System with Variational Autoencoders. Knowledge-Based Systems, 250. Article 109044.
  56. Leveraging Large Language Models in Conversational Recommender Systems. ArXiv:2305.07961.
  57. Multi-Turn Dialogue Agent as Sales’ Assistant in Telemarketing. In 2023 International Joint Conference on Neural Networks (IJCNN). Gold Coast, Australia.
  58. Horizon: Facebook’s Open Source Applied Reinforcement Learning Platform. ArXiv:1811.00260.
  59. Gibbard, A. 1973. Manipulation of Voting Schemes: A General Result. Econometrica, 41(4): 587–601.
  60. Learning to Groove with Inverse Sequence Transformations. In Proceedings of the Thirty-sixth International Conference on Machine Learning (ICML-19), 2269–2279. Long Beach, CA.
  61. Goodrow, C. 2021. On YouTube’s Recommendation System.
  62. Discovering Personalized Semantics for Soft Attributes in Recommender Systems Using Concept Activation Vectors. In Proceedings of the 31st International Web Conference (WWW-22), 2411–2421. Lyon. (Also arXiv 2202.02830).
  63. Conjoint Analysis in Marketing: New Developments with Implications for Research and Practice. Journal of Marketing, 54(4): 3–19.
  64. The Stereotyping Problem in Collaboratively Filtered Recommender Systems. In ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization (EAAMO-21), 1–10.
  65. Dynamic Mechanisms without Money. IHS Economics Series, No. 310, Institute for Advanced Studies (IHS), Vienna.
  66. Harsanyi, J. C. 1955. Cardinal Welfare, Individualistic Ethics, and Interpersonal Comparisons of Utility. Journal of Political Economy, 63(4): 309–321.
  67. Fairness of Exposure in Light of Incomplete Exposure Estimation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR-22), 759–769. Madrid.
  68. Focusing on the Long-term: It’s Good for Users and Business. In Proceedings of the Twenty-first ACM International Conference on Knowledge Discovery and Data Mining (KDD-15), 1849–1858. Sydney.
  69. Modeling Content Creator Incentives on Algorithm-curated Platforms. ArXiv:2206.13102.
  70. Collaborative Filtering for Implicit Feedback Datasets. In Proceedings of the Eighth IEEE International Conference on Data Mining (ICDM-08), 263–272. Pisa, Italy.
  71. Hurwicz, L. 1960. Optimality and Informational Efficiency in Resource Allocation Processes. In Arrow, K.; Karlin, S.; and Suppes, P., eds., Mathematical Methods in the Social Sciences, 27–46. Stanford, CA: Stanford University Press.
  72. Designing Economic Mechanisms. Cambridge University Press.
  73. Mechanism Design with Partial Revelation. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 1333–1340. Hyderabad, India.
  74. SlateQ: A Tractable Decomposition for Reinforcement Learning with Recommendation Sets. In Proceedings of the Twenty-eighth International Joint Conference on Artificial Intelligence (IJCAI-19), 2592–2599. Macau.
  75. Music Personalization at Spotify. In Proceedings of the 10th ACM Conference on Recommender Systems (RecSys16), 373–373. Boston, Massachusetts, USA.
  76. Supply-Side Equilibria in Recommender Systems. ArXiv:2206.13489.
  77. Evaluating the Accuracy of Implicit Feedback from Clicks and Query Reformulations in Web Search. ACM Transactions on Information Systems, 25(2). Article 7.
  78. Prospect Theory: An Analysis of Decision under Risk. Econometrica, 47(2): 263–292.
  79. Choices, Values, and Frames. Cambridge: Cambridge University Press.
  80. Optimal User Choice Engineering in Mobile Crowdsensing with Bounded Rational Users. In IEEE Conference on Computer Communications (INFOCOM-19), 1054–1062.
  81. Keeney, R. L. 1992. Value-Focused Thinking: A Path to Creative Decisionmaking. Cambridge, MA: Harvard University Press.
  82. Decisions with Multiple Objectives: Preferences and Value Trade-offs. New York: Wiley.
  83. Klein, E. 2020. Why We’re Polarized. Simon and Schuster.
  84. Heuristics for Product-line Design using Conjoint Analysis. Management Science, 1464–1478.
  85. GroupLens: Applying Collaborative Filtering to Usenet News. Communications of the ACM, 40(3): 77–87.
  86. Personalized Interactive Faceted Ssearch. In Proceedings of the 17th International World Wide Web Conference (WWW-08), 477–486. Beijing.
  87. Matrix Factorization Techniques for Recommender Systems. IEEE Computer, 42(8): 30–37.
  88. Advances in Collaborative Filtering. In Recommender Systems Handbook, 91–142. New York: Springer.
  89. Competitive Search. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR-22), 2838–2849. Madrid.
  90. Applying Learning Algorithms to Preference Elicitation. In ACM Conference on Electronic Commerce, 180–188. New York.
  91. Laibson, D. 1997. Golden Eggs and Hyperbolic Discounting. Quarterly Journal of Economics, 112(2): 443–478.
  92. A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning. In Advances in Neural Information Processing Systems 30 (NIPS-17), 4193–4206. Long Beach, CA.
  93. A Contextual-Bandit Approach to Personalized News Article Recommendation. In Proceedings of the 19th International Conference on World Wide Web (WWW-10), 661–670. Raleigh, NC.
  94. Fairness in Recommendation: Foundations, Methods and Applications. ACM Transactions on Intelligent Systems and Technology.
  95. The Construction of Preference. Cambridge University Press.
  96. Competing Bandits in Matching Markets. In Proceedings of the Twenty-third International Conference on Artificial Intelligence and Statistics (AIStats-20), 1618–1628.
  97. Fast Differentially Private Matrix Factorization. In Proceedings of the 9th ACM Conference on Recommender Systems (RecSys15), 171–178. Boston.
  98. Joint Optimization of Profit and Relevance for Recommendation Systems in E-commerce. In RMSE Workshop, RecSys-19. Copenhagen.
  99. Preference Elicitation and Robust Winner Determination for Single- and Multi-winner Social Choice. Artificial Intelligence, 279. Article:103203.
  100. Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare. In Proceedings of the Twenty-eighth Conference on Uncertainty in Artificial Intelligence (UAI-12), 543–553. Catalina, CA.
  101. Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach. ArXiv:2202.12797.
  102. Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline Reinforcement Learning. In Proceedings of the Thirty-ninth International Conference on Machine Learning (ICML-22), 14601–14638. Baltimore.
  103. Microeconomic Theory. New York: Oxford University Press.
  104. Auctions and Bidding. Journal of Economic Literature, 25: 699–738.
  105. Towards a Fair Marketplace: Counterfactual Evaluation of the Trade-off between Relevance, Fairness & Satisfaction in Recommendation Systems. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management (CIKM-18), 2243–2251. Turin.
  106. Mehta, A. 2013. Online Matching and Ad Allocation. Foundations and Trends in Theoretical Computer Science, 8(4): 265–368.
  107. Risk-sensitive Reinforcement Learning. Machine learning, 49: 267–290.
  108. Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approach. ArXiv:2008.00104.
  109. Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approach. In Proceedings of the Thirty-seventh International Conference on Machine Learning (ICML-20), 6987–6998. Vienna.
  110. Minimizing Polarization and Disagreement in Social Networks. In The 2018 Web Conference (WWW 2018). Lyon.
  111. Myerson, R. B. 1983. Mechanism Design by an Informed Principal. Econometrica, 1767–1797.
  112. Nisan, N. 2007. Introduction to Mechanism Design (for Computer Scientists). In Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V. V., eds., Algorithmic Game Theory, 209–241. Cambridge University Press.
  113. Pariser, E. 2011. The Filter Bubble: How the New Personalized Web is Changing What We Read and How We Think. Penguin Random House.
  114. Parkes, D. C. 1999. iBundle: An efficient ascending price bundle auction. In Proceedings of the First ACM Conference on Electronic Commerce (EC’99), 148–157. Denver.
  115. Parkes, D. C. 2007. Online Mechanisms. In Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V., eds., Algorithmic Game Theory, 411–439. Cambridge: Cambridge University Press.
  116. Content Prompting: Modeling Content Provider Dynamics to Improve User Welfare in Recommender Ecosystems. In RecSys-23 Workshop on Causality, Counterfactuals & Sequential Decision-Making (CONSEQUENCES-23). Singapore.
  117. Cumulative Prospect Theory meets Reinforcement Learning: Prediction and Control. In Proceedings of the Thirty-third International Conference on Machine Learning (ICML-16), 1406–1415. New York.
  118. Approximate Mechanism Design without Money. In Proceedings of the Tenth ACM Conference on Electronic Commerce (EC’09), 177–186. Stanford, CA.
  119. Approximate Mechanism Design without Money. In Proceedings of the Tenth ACM Conference on Electronic Commerce (EC’09), 177–186. Cambridge, MA.
  120. User-involved Preference Elicitation for Product Search and Recommender Systems. AI Magazine, 29(4): 93–103.
  121. Improving Language Understanding by Generative Pre-training. OpenAI.
  122. Discovering Personalized Semantics for Soft Attributes in Recommender Systems Using Concept Activation Vectors. In Proceedings of the Thirty-sixth AAAI Conference on Artificial Intelligence (AAAI-22), 12287–12293. Vancouver.
  123. Zero-shot Text-to-image Generation. In Proceedings of the Thirty-eighth International Conference on Machine Learning (ICML-21), 8821–8831.
  124. Getting to Know You: Learning New User Preferences in Recommender Systems. In International Conference on Intelligent User Interfaces (IUI-20), 127–134. San Francisco.
  125. Eliciting Additive Reward Functions for Markov Decision Processes. In Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI-11), 2159–2164. Barcelona.
  126. Auditing Radicalization Pathways on YouTube. In FAT* ’20: Conference on Fairness, Accountability, and Transparency, 131–141. Barcelona.
  127. Federating Recommendations using Differentially Private Prototypes. Pattern Recognition, 129. Article 108746.
  128. Roberts, K. 1979. The Characterization of Implementable Choice Rules. In Laffont, J.-J., ed., Aggregation and Revelation of Preferences, 321–349. Amsterdam: North-Holland.
  129. Probabilistic Matrix Factorization. In Advances in Neural Information Processing Systems 20 (NIPS-07), 1257–1264. Vancouver.
  130. Preference Ratios in Multiattribute Evaluation (PRIME)—Elicitation and Decision Procedures under Incomplete Information. IEEE Trans. on Systems, Man and Cybernetics, 31(6): 533–545.
  131. Preference Elicitation in Combinatorial Auctions. In Crampton, P.; Shoham, Y.; and Steinberg, R., eds., Combinatorial Auctions, 233–264. Cambridge, MA: MIT Press.
  132. Automated Design of Multistage Mechanisms. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 1500–1506. Hyderabad, India.
  133. Satterthwaite, M. A. 1975. Strategy-proofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions. Journal of Economic Theory, 10: 187–217.
  134. Schön, C. 2010. On the Optimal Product Line Selection Problem with Price Discrimination. Management Science, 56(5): 896–902.
  135. Mechanism Design without Money. In Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V. V., eds., Algorithmic Game Theory, 243–265. Cambridge University Press.
  136. Sen, A. 1970. The Impossibility of a Paretian Liberal. Journal of Political Economy, 78(1): 152–157.
  137. Shachter, R. D. 1986. Evaluating Influence Diagrams. Operations Research, 33(6): 871–882.
  138. An MDP-based Recommender System. Journal of Machine Learning Research, 6: 1265–1295.
  139. Fairness of Exposure in Rankings. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD-18), 2219–2228. London: Association for CompMachinery.
  140. Conversational recommender system. In 41st International ACM/SIGIR Conference on Research & Development in Information Retrieval (SIGIR-18), 235–244.
  141. Usage-based Web Recommendations: A Reinforcement Learning Approach. In Proceedings of the 1st ACM Conference on Recommender Systems (RecSys07), 113–120. Minneapolis: ACM.
  142. Revenue Management under a General Discrete Choice Model of Consumer Behavior. Management Science, 50(1): 15–33.
  143. Ensemble Contextual Bandits for Personalized Recommendation. In Proceedings of the 8th ACM Conference on Recommender Systems (RecSys14), 73–80. Foster City, CA.
  144. Rethinking Search Engines and Recommendation Systems: A Game Theoretic Perspective. Communications of the ACM, 62(12): 66–75.
  145. Lamda: Language Models for Dialog Applications. ArXiv:2201.08239.
  146. Polyhedral Methods for Adaptive Choice-Based Conjoint Analysis. Journal of Marketing Research, 41(1): 116–131.
  147. Judgment under Uncertainty: Heuristics and Biases. Science, 185(4157): 1124–1131.
  148. Preference-based Search using Example-Critiquing with Suggestions. Journal of Artificial Intelligence Research, 27: 465–503.
  149. The Tag Genome: Encoding Community Knowledge to Support Novel Interaction. ACM Transactions on Interactive Intelligent Systems, 2(3): 13:1–13:44.
  150. Show and Tell: A Neural Image Caption Generator. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR-15), 3156–3164.
  151. Revenue-optimized Webpage Recommendation. In 2015 IEEE International Conference on Data Mining Workshop (ICDMW), 1558–1559. Atlantic City.
  152. Values and Preferences: Defining Preference Construction. Wiley Interdisciplinary Reviews: Cognitive Science, 2(2): 193–205.
  153. A Survey of Faceted Search. Journal of Web Engineering, 12(1 & 2): 41–64.
  154. A Model of Multiattribute Decision-making and Trade-off Weight Determination under Uncertainty. IEEE Transactions on Systems, Man and Cybernetics, 14(2): 223–229.
  155. A Survey of Preference-based Reinforcement Learning Methods. Journal of Machine Learning Research, 18(136): 1–46.
  156. Joint Multisided Exposure Fairness for Recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR-22), 703–714. Madrid.
  157. Mixed Negative Sampling for Learning Two-tower Neural Networks in Recommendations. In Proceedings of the Web Conference (WWW-20), 441–447. Taipei.
  158. Diffusion Probabilistic Modeling for Video Generation. ArXiv:2203.09481.
  159. Sampling-bias-corrected Neural Modeling for Large Corpus Item Recommendations. In Proceedings of the Thirteenth ACM Conference on Recommender Systems (RecSys19), 269–277. Copenhagen.
  160. The k-armed Dueling Bandits pProblem. Journal of Computer and System Sciences, 78(5): 1538–1556.
  161. Towards Content Provider Aware Recommender Systems: A Simulation Study on the Interplay Between User and Provider Utilities. In Proceedings of the Web Conference 2021 (WWW-21), 3872–3883.
  162. Bounded Rationality and Robust Mechanism Design: An Axiomatic Approach. American Economic Review, 107(5): 235–239.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Craig Boutilier (78 papers)
  2. Martin Mladenov (22 papers)
  3. Guy Tennenholtz (30 papers)
Citations (6)

Summary

We haven't generated a summary for this paper yet.