New Algorithms for Approximate Nash Equilibria in Bimatrix Games

2007-12-01

Presented at the International Workshop on Internet and Network Economics , San Diego, CA, USA

Additional Metadata
MSC	2-person games (msc 91A05), Noncooperative games (msc 91A10)
THEME	Logistics (theme 3)
Publisher	Springer
Editor	X. Deng , F.C. Graham
Series	Lecture Notes in Computer Science
Project	Algorithmic Optimization Discretization
Conference	International Workshop on Internet and Network Economics
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Bosse, H., Byrka, J., & Markakis, V. (2007). New Algorithms for Approximate Nash Equilibria in Bimatrix Games. In X. Deng & F. C. Graham (Eds.), Internet and Network Economics (pp. 17–29). Springer.

Publication