Hardness of Approximation Between P and NP by Aviad Rubinstein (English) Paperba
131,11 €
By Aviad Rubinstein. Author Aviad Rubinstein. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one?. The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade.
Jetzt bei Ebay:
