Taming Complexity in Search Matching: Two-Sided Recommender Systems on Digital Platforms

We study digital multisided platforms as complex adaptive business systems (CABS) where multiple sides have different and evolving objectives, preferences, and constraints. CABS are characterized by irreducible uncertainty, which cannot be reduced by the traditional approaches of collecting and processing data. Irreducible uncertainty in the system gives rise to a complex search matching problem between agents and value enhancing transactions. This paper presents a recommender systems-based approach for taming the complexity by allowing agents to coevolve and learn in the system. We propose a novel two-sided recommender system framework, which considers emergence on both sides of the platform and adapts to the changing environment to influence agents. An agent-based simulation model is developed based on popular internet-based educational platforms to study this complex system and test our hypotheses. Our results show the value of a two-sided recommender system to tame complex search matching in platforms. We discuss implications for information systems and complexity science research.

• 저널MIS Quarterly · 44(1) · 49–84
• 토픽Game Theory and Applications · Management Science and Operations Research
• DOI10.25300/misq/2020/14424
• 저자Onkar Malgonde, He Zhang, Balaji Padmanabhan, Moez Limayem