In this paper, we consider task-level scheduling algorithms with respect to budget constraints for a bag of MapReduce jobs on a set of provisioned heterogeneous (virtual) machines in cloud platforms. The heterogeneity is manifested in the popular ”pay-as-you-go” charging model where the service machines with different performance would have different service rates. We organize a bag of jobs as ...

This paper makes some selective comparisons of the empirical evidence relating to financial discipline and soft budget constraints in the enterprise sector in China and the transition countries of Central and Eastern Europe and the former Soviet Union (CEEFSU). The paper finds that: (1) in both CEEFSU countries and China, budgetary subsidies have fallen as prices have been liberalized, and the ...

Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...

We consider a problem commonly faced in the nuclear power industry, involving annual selection of plant capital investments under the constraints of a limited and uncertain budget. When the budget is assumed known, a typical approach to such problems is built on a multi-dimensional knapsack model. This model takes as input the available budget in each year, the stream of liabilities induced by ...

Title of dissertation: ESSAYS ON AUCTION THEORY Justin Ellis Burkett, Doctor of Philosophy, 2012 Dissertation directed by: Professor Lawrence M. Ausubel Department of Economics This dissertation studies two features of high-value auctions that are not explicitly captured by the standard models in the auction theory literature. The first is that bidders in auctions for valuable assets sometimes ...

A natural way to deal with multiple, partially conflicting objectives is turning all the objectives but one into budget constraints. Some classical polynomial-time optimization problems, such as spanning tree and forest, shortest path, (perfect) matching, independent set (basis) in a matroid or in the intersection of two matroids, become NP-hard even with one budget constraint. Still, for most ...