Hardness of Approximation Between P and NP by Aviad Rubinstein (English) Paperba
105,70 €
By Aviad Rubinstein. Aviad Rubinstein is an Assistant Professor of Computer Science at Stanford University. Author Aviad Rubinstein. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one?.
Jetzt bei Ebay:
