August 2, 2018, 1:21 pm

Nevanlinna prize-winner Constantinos Daskalakis explained how he treated the problem of Nash equilibrium computing after 60 years.

The Greek mathematician confirmed that the so-called Nash equilibrium, a classic case of game theory, has the same complexity as NP-complete, that is, it is insoluble by any other algorithm. So, the behavior of competitors in a time compatible situation cannot always be predicted.

**Read more:**

This applies a market equilibrium in competitive situations. It is not guaranteed that competitors will always slip and that break-even and analysts will always be discovered.

Its removal is applied to a machine learning algorithm, based on artificial intelligence. This algorithm is based on the decision process, from examples, in an element of unknown class (like a photo) is of a certain type (car, for example).