Recently, given the first few moments, tight upper and lower bounds of the no arbitrage prices can be obtained by solving semidefinite programming (SDP) or linear programming (LP) problems. In this paper, we compare SDP and LP formulations of the European-style options pricing problem and prefer...

In this paper we discuss a basic framework for a grid computing market. It has long been argued that pricing of computer resources can act as a scheduling protocol. We take this idea to its natural conclusion by discussing the basic properties of such a model. We introduce agents that own...

Analyses of global climate policy as a sequential decision under uncertainty have been severely restricted by dimensionality and computational burdens. Therefore, they have limited the number of decision stages, discrete actions, or number and type of uncertainties considered. In particular,...