#### Filter Results:

#### Publication Year

2011

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—We consider the dynamic search of a target located in one of K cells. At each time, one cell is searched, and the search result is subject to false alarms. The objective is a policy that governs the sequential selection of the cells to minimize the error probability of detecting the whereabouts of the target within a fixed time horizon. We show that the… (More)

—We consider a dynamic pricing problem with unknown demand models. In this problem, a seller offers prices sequentially to a stream of potential customers and observes either success or failure in each sales attempt. The underlying demand model is unknown and can take one of two possible forms. We show that the problem can be formulated as a two-armed… (More)

We consider a dynamic pricing problem under unknown demand models. In this problem a seller offers prices to a stream of customers and observes either success or failure in each sale attempt. The underlying demand model is unknown to the seller and can take one of N possible forms. In this paper, we show that this problem can be formulated as a multi-armed… (More)

—We consider a multi-seller dynamic pricing problem with unknown demand models. In this problem, each seller offers prices sequentially to a stream of potential customers. Each customer considers only the lowest price among all sellers, and the probability of making a purchase is governed by an unknown demand model that can take a finite number of possible… (More)

—We consider the shortest path problem in a communication network with random link costs drawn from unknown distributions. A realization of the total end-to-end cost is obtained when a path is selected for communication. The objective is an online learning algorithm that minimizes the total expected communication cost in the long run. The problem is… (More)

- ‹
- 1
- ›