In 1979, Weitzman introduced Pandora's box problem as a framework for sequential search
with costly inspections. Recently, there has been a surge of interest in Pandora's box …

Weitzman (1979) introduced Pandora's box problem as a mathematical model of sequential
search with inspection costs, in which a searcher is allowed to select a prize from one of n …

We study a variation of the classical Pandora's problem in which a decision maker (DM)
sequentially explores alternatives from a given set and learns their values while trying to …

We study a generalized Pandora's box problem Weitzman (1979) in which boxes could be
either (fully) opened for a certain fee to reveal their exact prizes, or partially opened at a …

Market algorithms are ubiquitous in modern life, both online and offline. Historically, markets
have been fundamental in matching supply with demand, where designers optimize …

We consider a set of APs with unknown data rates that cooperatively serve a mobile client.
The data rate of each link is iid sampled from a distribution that is unknown a priori. In …

Online markets have transformed many economic and social activities and have brought
forward new computational challenges. In particular, dealing with large-scale user data has …