跳至主要内容

Game Analysis of SME Financing

In financing activities, information asymmetry between SMEs and investors is widespread. SMEs own relatively complete information about their future profitability. Whereas, the investors are often difficult to fully grasp the future profitability of SMEs, which means that they have incomplete information (Gao, 2011). This paper analyzes SMEs’ financing problem from two perspectives: dynamic game of complete information and dynamic game of incomplete information. On the basis of the above analysis, it tries to identify the main reasons and viable solutions to change the status quo in SME financing.

The financial system must be established and improved in enterprises to ensure financial information is truthful, accurate and complete, enhance the transparency of financial information. A good image should be established by means of passing real and complete information to the bank through effective way. From long-term perspective, cooperative relationship between banks and enterprises should be established. This relationship is helpful to reduce financing costs, increase credit profits, evade credit risks, and enhance the competitiveness of SMEs in China.

Article by Pingzhong Lin,from Jimei University, Xiamen, China

Full access: http://mrw.so/2ohg04
Image by BizSmart Finance,from Flickr-cc



评论

发表评论

此博客中的热门博文

Electron Spin and Proton Spin in the Hydrogen and Hydrogen-Like Atomic Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52202#.VIj7tMnQrzE Author(s) Stanisław Olszewski * Affiliation(s) Institute of Physical Chemistry, Polish Academy of Sciences, Warsaw, Poland . ABSTRACT The mechanical angular momentum and magnetic moment of the electron and proton spin have been calculated semiclassically with the aid of the uncertainty principle for energy and time. The spin effects of both kinds of the elementary particles can be expressed in terms of similar formulae. The quantization of the spin motion has been done on the basis of the old quantum theory. It gives a quantum number n = 1/2 as the index of the spin state acceptable for both the electron and proton ...
发表评论
阅读全文

Incorporation of High-Altitude Balloon Experiment in High School Science Classrooms

High-altitude balloon is a balloon, filled usually with helium or hydrogen that ascends into an area called “near space” or stratosphere. The most common type of high-altitude balloons are weather balloons. Other purposes include use as a platform for experiments in the upper atmosphere. Modern balloons generally contain electronic equipment such as radio transmitters, cameras, or satellite navigation systems, such as GPS receivers. The mission of the High-Altitude Balloon Experiment (HABE) is to acquire supporting data, validate enabling technologies, and resolve critical acquisition, tracking, and pointing (ATP) and fire control issues in support of future space-based precision pointing experiments. The use of high-altitude balloons offers a relatively low-cost, low-vibration test platform, a recoverable and reusable payload, worldwide launch capability, and a 'near- space' emulation of the future space systems operational scenarios. More recently, several university...
1 条评论
阅读全文

Remarks on the Complexity of Signed k-Domination on Graphs

Read  full  paper  at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53574#.VMnXsCzQrzE Author(s)    Chuan-Min Lee 1 , Cheng-Chien Lo 1 , Rui-Xin Ye 2 , Xun Xu 2 , Xiao-Han Shi 2 , Jia-Ying Li 2 Affiliation(s) 1 Department of Computer and Communication Engineering, Ming Chuan University, The First American University in Asia, Taoyuan, Taiwan, Chinese Taipei . 2 Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China . ABSTRACT This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chord...
发表评论
阅读全文