Optimal Stopping Theory for a Distributionally Robust Seller
Pieter Kleer, Johan van Leeuwaarden

TL;DR
This paper develops a robust optimal stopping framework for sellers with limited distributional information, providing threshold-based strategies that safeguard against adversarial distribution choices.
Contribution
It introduces a maximin solution for distributionally robust stopping problems, analyzing various ambiguity sets and characterizing the seller's optimal thresholds under uncertainty.
Findings
Seller's stopping thresholds decrease and converge to the mean.
Nature's worst-case distribution tends to be all-or-nothing.
Threshold strategies adapt as the number of offers or dispersion increases.
Abstract
Sellers in online markets face the challenge of determining the right time to sell in view of uncertain future offers. Classical stopping theory assumes that sellers have full knowledge of the value distributions, and leverage this knowledge to determine stopping rules that maximize expected welfare. In practice, however, stopping rules must often be determined under partial information, based on scarce data or expert predictions. Consider a seller that has one item for sale and receives successive offers drawn from some value distributions. The decision on whether or not to accept an offer is irrevocable, and the value distributions are only partially known. We therefore let the seller adopt a robust maximin strategy, assuming that value distributions are chosen adversarially by nature to minimize the value of the accepted offer. We provide a general maximin solution to this stopping…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Spam and Phishing Detection · Mobile Crowdsensing and Crowdsourcing
