This paper deals with a basic issue: How does one approach the problem of designing the "right" objective for a given resource allocation problem? The notion of what is right can be fairly nebulous; we consider two issues that we see as key: efficiency and fairness. We approach the problem of...

Choice models today are ubiquitous across a range of applications in operations and marketing. Real-world implementations of many of these models face the formidable stumbling block of simply identifying the "right" model of choice to use. Because models of choice are inherently high-dimensional...

We introduce the pathwise optimization (PO) method, a new convex optimization procedure to produce upper and lower bounds on the optimal value (the "price") of a high-dimensional optimal stopping problem. The PO method builds on a dual characterization of optimal stopping problems as...

We study the interplay between financial covenants and the operational decisions of a retailer that obtains financing through a secured, inventory-based lending contract. We characterize how leverage affects dynamic inventory decisions, and find that it can lead to surprising non-threshold...

We develop a new model for studying the phenomenon of congestion in a transient environment, focusing on the problem of aircraft landings at a busy "hub" airport. Our model is based on a Markov/semi-Markov treatment of changes in the weather, the principal source of uncertainty governing service...

Includes bibliographical references (p. 48-50).

This paper presents a binary optimization framework for modeling dynamic resource allocation problems. The framework (a) allows modeling flexibility by incorporating different objective functions, alternative sets of resources and fairness controls; (b) is widely applicable in a variety of...