An Empirical Study on the Long-Run Performance of Cross-Listings by Multinational Corporations (다국적기업 해외상장의 장기적인 성과에 관한 연구)
-
- The Korean Journal of Financial Management
- /
- v.21 no.2
- /
- pp.27-63
- /
- 2004
Since the 1980s, many multinational corporations have been issuing stocks on foreign stock exchanges, not only to enhance their investor base and liquidity, but also to diversify risks. The phenomenon has also been intensified by the rapid financial globalization and securitization trends. The main purpose of this study is to look into the long-run performance of MNCs' cross-listings of stocks on foreign stock exchanges. We use the event study and cross-sectional regression methods. We obtained some interesting empirical results about the long-run effect of cross-listings. First before the listing data the effect of cross-listing is to increase the underlying stock Vice in the local market. It may be caused by expectation of lower risk and cost of capital. However, after the listing data the stock price has been declining, even if it is not significant. Second, we examine the difference in the long-run cross-listing effect, which may be caused by the listing direction. When listing is made from a less developed market to a more developed market, the effect is better than that in the reverse direction. Furthermore, the effect is worse, when the listing company's home country is the U.S. Third, there is a negative relation between CARs and underlying stock liquidity in the local market, So it implies that a firm, whose underlying stocks are very liquid in the local market should carefully value cross-listing based upon the cost and benefit analysis. Last, but not the least we find that the long-un cross-listing effect is better, when a listing firm's ROE is higher.
Recommender system has become one of the most important technologies in e-commerce in these days. The ultimate reason to shop online, for many consumers, is to reduce the efforts for information search and purchase. Recommender system is a key technology to serve these needs. Many of the past studies about recommender systems have been devoted to developing and improving recommendation algorithms and collaborative filtering (CF) is known to be the most successful one. Despite its success, however, CF has several shortcomings such as cold-start, sparsity, gray sheep problems. In order to be able to generate recommendations, ordinary CF algorithms require evaluations or preference information directly from users. For new users who do not have any evaluations or preference information, therefore, CF cannot come up with recommendations (Cold-star problem). As the numbers of products and customers increase, the scale of the data increases exponentially and most of the data cells are empty. This sparse dataset makes computation for recommendation extremely hard (Sparsity problem). Since CF is based on the assumption that there are groups of users sharing common preferences or tastes, CF becomes inaccurate if there are many users with rare and unique tastes (Gray sheep problem). This study proposes a new algorithm that utilizes Social Network Analysis (SNA) techniques to resolve the gray sheep problem. We utilize 'degree centrality' in SNA to identify users with unique preferences (gray sheep). Degree centrality in SNA refers to the number of direct links to and from a node. In a network of users who are connected through common preferences or tastes, those with unique tastes have fewer links to other users (nodes) and they are isolated from other users. Therefore, gray sheep can be identified by calculating degree centrality of each node. We divide the dataset into two, gray sheep and others, based on the degree centrality of the users. Then, different similarity measures and recommendation methods are applied to these two datasets. More detail algorithm is as follows: Step 1: Convert the initial data which is a two-mode network (user to item) into an one-mode network (user to user). Step 2: Calculate degree centrality of each node and separate those nodes having degree centrality values lower than the pre-set threshold. The threshold value is determined by simulations such that the accuracy of CF for the remaining dataset is maximized. Step 3: Ordinary CF algorithm is applied to the remaining dataset. Step 4: Since the separated dataset consist of users with unique tastes, an ordinary CF algorithm cannot generate recommendations for them. A 'popular item' method is used to generate recommendations for these users. The F measures of the two datasets are weighted by the numbers of nodes and summed to be used as the final performance metric. In order to test performance improvement by this new algorithm, an empirical study was conducted using a publically available dataset - the MovieLens data by GroupLens research team. We used 100,000 evaluations by 943 users on 1,682 movies. The proposed algorithm was compared with an ordinary CF algorithm utilizing 'Best-N-neighbors' and 'Cosine' similarity method. The empirical results show that F measure was improved about 11% on average when the proposed algorithm was used