In this paper we consider stochastic discrete optimization problems (DOP) in which feasible solutions remain feasible irrespective of the randomness of the problem parameters. We introduce the concept of the risk associated with a solution and define optimal solution in terms of having least...

In this paper we present a strategy for speeding up the estimation of expected maximum flows through reliable networks. Our strategy tries to minimize the repetition of computational effort while evaluating network states sampled using the crude Monte Carlo method. Computational experiments with...

Behavioral experiments conducted so far to establish existence of endowment effect as propounded by prospect theorists typically endow subjects with a single good. In this paper we depart from this setting by giving subjects initial endowment bundles which consist of two goods: chocolates and...