https://hackerpaper.kaipfister.de/p/1104.3760/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=24845106urn:hackerpapers:mention:1104.3760:24845106Wed, 21 Oct 2020 05:50:35 GMT<p>The report, while a fun thought exercise for any aspiring academic, is not a novel insight, and is obviously untrue for most definitions of market efficiency. If we are going to play the academic one-upmanship game, a more general result that &quot;best&quot; or &quot;multiple&quot; N-player Nash Equilibria for N &gt; 2 is already NP-hard. The implication of an efficient market would be if every player had a polynomial-time algorithm to solve the NP-hard problem, ergo P=NP. [1] https://people.csail.mit.edu/costis/simplified.pdf [2] https://www.quantamagazine.org/in-game-theory-no-clear-path-... [3]…</p><p><a href="https://hackerpaper.kaipfister.de/p/1104.3760/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC