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]
@inproceedings{GoldbergP12,
title = {On the Communication Complexity of Approximate Nash Equilibria},
author = {Paul W. Goldberg and Arnoud Pastink},
year = {2012},
doi = {10.1007/978-3-642-33996-7_17},
url = {http://dx.doi.org/10.1007/978-3-642-33996-7_17},
researchr = {https://researchr.org/publication/GoldbergP12},
cites = {0},
citedby = {0},
pages = {192-203},
booktitle = {Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings},
editor = {Maria J. Serna},
volume = {7615},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-33995-0},
}