2 ms·
It's actually an analogy with great applicability. Quite a bit of work has been done on this topic - see the work of Pennock at Yahoo. One result: completely ef
by yummyfajitas 16y ago
It's actually an analogy with great applicability. Quite a bit of work has been done on this topic - see the work of Pennock at Yahoo. One result: completely efficient prediction market is a general purpose computer. Such an object also requires a ridiculous number of market participants, since it can solve NP complete problems.
http://dpennock.com/publications.html http://dpennock.com/publications.html
One very popular result (major media attention) along these lines is this paper, which proves that pricing a certain type of CDO is an NP-complete problem:
http://www.cs.princeton.edu/~rongge/derivative.pdf http://www.cs.princeton.edu/~rongge/derivative.pdf
(Side note: this paper really pisses me off because they did not cite ANY of the prediction market literature. It's hard to believe this was not on purpose.)