On the Communication Complexity of Approximate Nash Equilibria - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Paul W. Goldberg, Arnoud Pastink. On the Communication Complexity of Approximate Nash Equilibria. In Maria J. Serna, editor, Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings. Volume 7615 of Lecture Notes in Computer Science, pages 192-203, Springer, 2012. [doi]

This author has not been identified. Look up 'Paul W. Goldberg' in GoogleThis author has not been identified. Look up 'Arnoud Pastink' in Google

runs on WebDSL