This study examines how the stock prices are affected when articles, which negatively describe the companies? incentive programs, are published. According to the efficient market hypothesis, only new information should have an effect on the stock price. Furthermore, this study aims to examine whether this reaction is dependent of the economic climate. During the period of September 2005 to September 2009, stock price data was collected from the NasdaqOMX stock exchange and 75 articles were gathered from leading Swedish newspapers.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

Until recently, the art market has expanded for several consecutive years. The primary art market is characterized by an unclear pricing mechanism and an infinite as well as limited supply. Previous business studies have so far primarily focused either on art as an investment or on the gallery?s activities. This thesis takes an explorative approach and aims to shed a light on the art collector?s behavior on the Swedish market for contemporary art.

In a historical view, house prices have developed at the same rate as inflation. In the end of the 20th century the prices on the housing market started to differ from the inflation rate, and today the deviation is strong and the real price increase has been very strong.The financial crisis in 2008, which was a result of a subprime mortgage crisis on the American real estate market, has made several agents on the housing market in Sweden question today?s prices. Robert Schiller, an American economist who predicted the mortgage crisis in 2008, claimed during the Nobel Prize ceremony 2013, that Sweden shows signs of a financial bubble ? "I think that people here in Sweden have an illusion that increasing prices is a lasting trend, but that is more suggestive of a bubble".

In the year of 2006 I moved to South Africa for a year, a land that has fascinated me because of its history. During the time of my stay I became very surprised how strongly apartheid permeates the community where the white South Africans today are building walls around themselves. Through media we get surrounded with pictures that media creates and to find information regarding what?s happening in the world this is, most often, the primary source. Therefore I believe it?s interesting to explore how two different local newspapers from the county of Kalmar, with two different ideologies, present pictures of the same event, namely the revolt of Soweto in 1976 and how these two newspapers relates to racial policies.

It is important for all companies to be seen on a competitive market. It?s all about positioning yourself so that you?re seen and that you?re are attractive for both customers and employees. A crucial factor to achieve this are how the brand are handle directly by the company it self and by the market. Establishing a brand on the market is not easy and it takes time to establish what the company stands for.

The aim of this paper is to get a deeper understanding if research about international relations has any practical meaning. The main focal point is about the importance of the scholar idea soft power, and its meaning on foreign policy actions through expressions. A quantity and quality method is used. The point of the main theory that concerns international relations takes a rationalistic perspective, and expands it to the notion that ides can have an impact on policy outcomes. Three different types of research utilization can be traced to determine in which way an idea is getting implemented.

The rise of the Swedish Democrats, as a political party in Sweden, has been surroundedby controversy both within and outside of the media. As such a polarizingtopic, the party has been the focus of negative and positive attention. On onehand it has been considered a racist and xenophobic party due to its policies onimmigrants. On the other, it has also been seen as a solution to what has been consideredby some to be a constant problem in Sweden, for those same policies.These policies are motivated by what the party perceives as a threat to Swedishsociety. That is to say, immigrants are a threat to Sweden because of thechanges they impose on the Swedish identity.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.