Slashdot is powered by your submissions, so send in your scoop

 



Forgot your password?
typodupeerror
Check out the new SourceForge HTML5 internet speed test! No Flash necessary and runs on all devices. ×
Math

What Computer Science Can Teach Economics 421

eldavojohn writes "A new award-winning thesis from an MIT computer science assistant professor showed that the Nash equilibrium of complex games (like the economy or poker) belong to problems with non-deterministic polynomial (NP) complexity (more specifically PPAD complexity, a subset of TFNP problems which is a subset of FNP problems which is a subset of NP problems). More importantly there should be a single solution for one problem that can be adapted to fit all the other problems. Meaning if you can generalize the solution to poker, you have the ability to discover the Nash equilibrium of the economy. Some computer scientists are calling this the biggest development in game theory in a decade."

Slashdot Top Deals

Five is a sufficiently close approximation to infinity. -- Robert Firth "One, two, five." -- Monty Python and the Holy Grail

Working...