3 resultados para SOLUTION-PHASE APPROACH

em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco


Relevância:

100.00% 100.00%

Publicador:

Resumo:

We study international environmental negotiations when agreements between countries can not be binding. A problem with this kind of negotiations is that countries have incentives for free-riding from such agreements. We develope a notion of equilibrium based on the assumption that countries can create and dissolve agreements in their seeking of a larger welfare. This approach leads to a larger degree of cooperation compared to models based on the internal-external stability approach.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper analyzes whether a minimum wage can be an optimal redistribution policy when distorting taxes and lump-sum transfers are also available in a competitive economy. We build a static general equilibrium model with a Ramsey planner making decisions on taxes, transfers, and minimum wage levels. Workers are assumed to differ only in their productivity. We find that optimal redistribution may imply the use of a minimum wage. The key factor driving our results is the reaction of the demand for low skilled labor to the minimum wage law. Hence, an optimal minimum wage appears to be most likely when low skilled households are scarce, the complementarity between the two types of workers is large or the difference in productivity is small. The main contribution of the paper is a modelling approach that allows us to adopt analysis and solution techniques widely used in recent public finance research. Moreover, this modelling strategy is flexible enough to allow for potential extensions to include dynamics into the model.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Quantum Computing is a relatively modern field which simulates quantum computation conditions. Moreover, it can be used to estimate which quasiparticles would endure better in a quantum environment. Topological Quantum Computing (TQC) is an approximation for reducing the quantum decoherence problem1, which is responsible for error appearance in the representation of information. This project tackles specific instances of TQC problems using MOEAs (Multi-objective Optimization Evolutionary Algorithms). A MOEA is a type of algorithm which will optimize two or more objectives of a problem simultaneously, using a population based approach. We have implemented MOEAs that use probabilistic procedures found in EDAs (Estimation of Distribution Algorithms), since in general, EDAs have found better solutions than ordinary EAs (Evolutionary Algorithms), even though they are more costly. Both, EDAs and MOEAs are population-based algorithms. The objective of this project was to use a multi-objective approach in order to find good solutions for several instances of a TQC problem. In particular, the objectives considered in the project were the error approximation and the length of a solution. The tool we used to solve the instances of the problem was the multi-objective framework PISA. Because PISA has not too much documentation available, we had to go through a process of reverse-engineering of the framework to understand its modules and the way they communicate with each other. Once its functioning was understood, we began working on a module dedicated to the braid problem. Finally, we submitted this module to an exhaustive experimentation phase and collected results.