Reconfiguration of a power distribution system consists in changing the functional links among its elements and represents one of the most important actions for the improvement of system performance in operation. In the last few years, some authors have proposed approaches based on Pareto optimality for problem formulation of reconfiguration, with active power losses and reliability indices as ...

We study a stochastic version of Fudenberg–Tirole’s preemption game. Two firms contemplate entering a new market with stochastic demand. Firms differ in sunk costs of entry. If the demand process has no upward jumps, the low cost firm enters first, and the high cost firm follows. If leader’s optimization problem has an interior solution, the leader enters at the optimal threshold of a monopolis...

This paper presents a technique that incorporates preference information within the framework of multi-objective evolutionary algorithms for the solution of many-objective optimization problems. The proposed approach employs a single reference point to express the preferences of a decision maker, and adaptively biases the search procedure toward the region of the Pareto-optimal front that best ...

Symbolic search with BDDs has shown remarkable performance for cost-optimal deterministic planning by exploiting a succinct representation and exploration of state sets. In this paper we enhance BDD-based planning by applying a combination of domain-independent search techniques: the optimization of the variable ordering in the BDD by approximating the linear arrangement problem, pattern select...

Although the celebrated Vickrey auction is strategy-proof and guaranteed to achieve an efficient allocation in a singleobject auction, if there exists no outside party (i.e., a seller or an auctioneer) with the right to collect the payment, the collected payment will be wasted. Redistribution mechanisms try to redistribute the payment to participating agents as much as possible without violatin...

Abstract: We address the problem of deriving Pareto optimal solutions of multiple objective optimization problems with predetermined upper bounds on trade-offs. As shown, this can be achieved by a linear transformation of objective functions. Each non-diagonal element of the transformation matrix is related to a bound on the trade-off between a pair of the objective functions.

The majority of engineering optimization problems (design, identification, design of controlled systems, optimization of large-scale systems, operational development of prototypes, and so on) are essentially multicriteria. The correct determination of the feasible solution set is a major challenge in engineering optimization problems. In order to construct the feasible solution set, a method ca...

Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set computations that includes all these algorithms as particular cases. To make our algorithm understandable to people working in optimization and in game theory, we also provide motivations and explanations for our formal...

A dynamic Walrasian economy is said to exhibit inconsistency if the competitive equilibrium path resulting from government reoptimization at some time rr0 is not a continuation of the competitive equilibrium path resulting from the initial government optimization at time 0. The present paper establishes necessary and sufficient conditions for consistency for a general class of dynamic Walrasian...

In this work, we investigate tools that enable dollar cost optimization of scientific simulations using commercial clouds. We present a framework, called CLOUDTRACKER, that transparently records information from a simulation that is executed in a commercial cloud so that it may be “replayed” exactly to reproduce its results. Using the automated CLOUDTRACKER provenance and replay facilities, sci...