The Effects of Terrorism on Turkish Financial Markets

Abstract

In this research, we analyzed how Turkish financial markets and foreign investors in the stock market reacted to the terror attacks in Turkey. Our analysis, which was performed using the terror index for the stock market and the foreign exchange market, revealed that returns, abnormal returns, and cumulative abnormal returns were not affected by the terror attacks; however, foreign investors in the stock market were affected. When the geographic regions of the terror attacks were analyzed, the findings showed that foreign investors were negatively affected mainly by the terror attacks that occurred in southeast Anatolia. Attack type and target type were important only for foreign investors. An evaluation of the interaction between the terror attacks and the markets with the involvement of the terrorist organizations indicated that only the foreign investors in the stock market were affected by Al-Qaeda and PKK-linked terror attacks. An evaluation of the effect of terror attacks in foreign countries on Turkish financial markets revealed no effect on the domestic stock market and foreign exchange markets. We also examined the volatility spillovers from the terror index to the stock market and found that terrorist attacks increased the volatility of the stock market.     

An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming

Although there has been extensive research on interactive multiple objective decision making in the last two decades, there is still a need for specialized interactive algorithms that exploit the relatively simple structure of bicriterion programming problems. This article develops an interactive branch-and-bound algorithm for bicriterion nonconvex programming problems. The algorithm searches among only the set of nondominated solutions since one of them is a most preferred solution that maximizes the overall value function of the decision maker over the set of achievable solutions. The interactive branch-and-bound algorithm requires only pairwise preference comparisons from the decision maker. Based on the decision maker's responses, the algorithm reduces the set of nondominated solutions and terminates with his most preferred nondominated solution. Branching corresponds to dividing the subset of nondominated solutions considered at a node into two subsets. The incumbent solution is updated based on the preference of the decision maker between two nondominated solutions. Fathoming decisions are based on the decision maker's preference between the incumbent solution and the ideal solution of the node in consideration.