Learning User Preferences to Incentivize Exploration in the Sharing Economy
Not on the map. Why?
Abstract (arXiv)
We study platforms in the sharing economy and discuss the need for incentivizing users to explore options that otherwise would not be chosen. For instance, rental platforms such as Airbnb typically rely on customer reviews to provide users with relevant information about different options. Yet, often a large fraction of options does not have any reviews available. Such options are frequently neglected as viable choices, and in turn are unlikely to be evaluated, creating a vicious cycle. Platforms can engage users to deviate from their preferred choice by offering monetary incentives for choosing a different option instead. To efficiently learn the optimal incentives to offer, we consider structural information in user preferences and introduce a novel algorithm - Coordinated Online Learning (CoOL) - for learning with structural information modeled as convex constraints. We provide formal guarantees on the performance of our algorithm and test the viability of our approach in a user study with data of apartments on Airbnb. Our findings suggest that our approach is well-suited to learn appropriate incentives and increase exploration on the investigated platform.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 1.
4 papers.
- 2021Incentivizing Exploration in Linear Bandits under Information Gapcited by 5
- 2023Initializing Services in Interactive ML Systems for Diverse Userscited by 5
- 2024Incentivized Exploration of Non-Stationary Stochastic Banditscited by 3
- 2025Incentivized Lipschitz Banditscited by 2
- 2025Incentivized Lipschitz Bandits26 Aug 2025
- 2024Incentivized Exploration of Non-Stationary Stochastic Bandits16 Mar 2024
- 2023Initializing Services in Interactive ML Systems for Diverse Users19 Dec 2023
- 2021Incentivizing Exploration in Linear Bandits under Information Gap8 Apr 2021