Includes bibliographical references (p. 48-50).

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...

In this paper, we combine robust optimization and the idea of ∊-arbitrage to propose a tractable approach to price a wide variety of options. Rather than assuming a probabilistic model for the stock price dynamics, we assume that the conclusions of probability theory, such as the central limit...

In this paper, we consider adjustable robust versions of convex optimization problems with uncertain constraints and objectives and show that under fairly general assumptions, a static robust solution provides a good approximation for these adjustable robust problems. An adjustable robust...