Philip Maymin
NYU Poly - Department of Finance and Risk Engineering
February 28, 2011
Algorithmic Finance, Vol. 1, No. 1, 2011
NYU Poly Research Paper
Abstract:
I prove that if markets are efficient, meaning current prices fully reflect all information available in past prices, then P = NP, meaning every computational problem whose solution can be verified in polynomial time can also be solved in polynomial time. I also prove the converse by showing how we can “program” the market to solve NP-complete problems. Since P probably does not equal NP, markets are probably not efficient. Specifically, markets become increasingly inefficient as the time series lengthens or becomes more frequent. An illustration by way of partitioning the excess returns to momentum strategies based on data availability confirms this prediction.
Number of Pages in PDF File: 32
Keywords: algorithmic finance, efficiency, complexity, computation, P, NP
Download pdf: http://adf.ly/AaR6X
0 comments:
Post a Comment