CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty
Authors
Wenshuo Guo
Nika Haghtalab
Kirthevasan Kandasamy
Ellen Vitercik
Publication date
11 September 2023
Publisher
View
on
arXiv
Abstract
In online marketplaces, customers have access to hundreds of reviews for a single product. Buyers often use reviews from other customers that share their type -- such as height for clothing, skin type for skincare products, and location for outdoor furniture -- to estimate their values, which they may not know a priori. Customers with few relevant reviews may hesitate to make a purchase except at a low price, so for the seller, there is a tension between setting high prices and ensuring that there are enough reviews so that buyers can confidently estimate their values. Simultaneously, sellers may use reviews to gauge the demand for items they wish to sell. In this work, we study this pricing problem in an online setting where the seller interacts with a set of buyers of finitely many types, one by one, over a series of
T
T
T
rounds. At each round, the seller first sets a price. Then a buyer arrives and examines the reviews of the previous buyers with the same type, which reveal those buyers' ex-post values. Based on the reviews, the buyer decides to purchase if they have good reason to believe that their ex-ante utility is positive. Crucially, the seller does not know the buyer's type when setting the price, nor even the distribution over types. We provide a no-regret algorithm that the seller can use to obtain high revenue. When there are
d
d
d
types, after
T
T
T
rounds, our algorithm achieves a problem-independent
O
~
(
T
2
/
3
d
1
/
3
)
\tilde O(T^{2/3}d^{1/3})
O
~
(
T
2/3
d
1/3
)
regret bound. However, when the smallest probability
q
min
q_{\text{min}}
q
min
β
that any given type appears is large, specifically when
q
min
β
Ξ©
(
d
β
2
/
3
T
β
1
/
3
)
q_{\text{min}} \in \Omega(d^{-2/3}T^{-1/3})
q
min
β
β
Ξ©
(
d
β
2/3
T
β
1/3
)
, then the same algorithm achieves a
O
~
(
T
1
/
2
q
min
β
1
/
2
)
\tilde O(T^{1/2}q_{\text{min}}^{-1/2})
O
~
(
T
1/2
q
min
β
1/2
β
)
regret bound. We complement these upper bounds with matching lower bounds in both regimes, showing that our algorithm is minimax optimal up to lower-order terms
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2302.09700
Last time updated on 16/03/2023