期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
When q theory meets large losses risks and agency conflicts
1
作者 WANG Ying HUANG Wen-li LI Sheng-hong 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2017年第4期477-492,共16页
We incorporate large losses risks into the DeM arzo et al.(2012) model of dynamic agency and the q theory of investment.The large losses risks induce losses costs and losses arising from agency conflicts during the la... We incorporate large losses risks into the DeM arzo et al.(2012) model of dynamic agency and the q theory of investment.The large losses risks induce losses costs and losses arising from agency conflicts during the large losses prevention process.Both of them reduce firm’s value,distort investment policy and generate a deeper wedge between the marginal and average q.In addition,we study the implementation of the contract to enhance the practical utility of our model.The agent optimally manages the firm’s cash flow and treats the cash reservation and credit line as the firm’s financial slack,and hedges the productivity shocks and large losses shocks via futures and insurance contracts,respectively. 展开更多
关键词 agency problem large losses q theory INVESTMENT
下载PDF
Formularless Logic Function
2
作者 Alexey Nikolayevitch Teterin 《Open Journal of Discrete Mathematics》 2013年第1期21-24,共4页
The concept of computability is defined more exactly and illustrated as an example of Boolean functions and cryptanalysis. To define a Boolean function is not necessary to record its formula. To do that the reduced (c... The concept of computability is defined more exactly and illustrated as an example of Boolean functions and cryptanalysis. To define a Boolean function is not necessary to record its formula. To do that the reduced (compact) description of values is determined in the truth table or in the statement of the problem. We obtain estimates of computation time, the volume of a compact descriptions and the range of variables under which it takes the value 0 or 1, depending polynomially on the number of arguments. 展开更多
关键词 COMPLEXITY of Computation(03D15) Models of Computation(68q05) Analysis of Algorithms and Problem Complexity(68q25) Computational Learning theory(68q32) SEPARABILITY SATISFIABILITY FUZZINESS Dynamical Systems COMPUTABILITY
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部