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 acquire the best alternative. The variations in the model we study are (i) alternatives randomly become unavailable...

Many sequential decision problems involve deciding how to allocate shared resources across a set of independent systems at each point in time. A classic example is the restless bandit problem, in which a budget constraint limits the selection of arms at each point in time. Fluid relaxations...

We consider a sequential decision problem involving shared resources and signals in which a decision maker repeatedly observes some exogenous information (the signal), modeled as a finite-state Markov process, then allocates a limited amount of a shared resource across a set of projects. The...

Many stochastic dynamic programs (DPs) have a weakly coupled structure in that a set of linking constraints in each period couple an otherwise independent collection of subproblems. Two widely studied approximations of such problems are approximate linear programs (ALP), which involve optimizing...

Motivated by applications in shared vehicle systems, we study dynamic pricing of resources that relocate over a network of locations. Customers with private willingness-to-pay sequentially request to relocate a resource from one location to another, and a revenue-maximizing service provider sets...