We study a submodular maximization problem motivated by applications in online retail. A platform displays a list of products to a user in response to a search query. The user inspects the first k items in the list for a k chosen at random from a given distribution, and makes a decision whether...

We consider the multi-period pricing problem of a service firm facing time-varying capacity levels. Customers are assumed to be fully strategic with respect to their purchasing decisions, and heterogeneous with respect to their valuations, and arrival-departure periods. The firm's objective is...