Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

SOFSEM
2010
Springer

favoriteEmaildiscussreport

107views Theoretical Computer Science» more SOFSEM 2010»

Linear Complementarity Algorithms for Infinite Games

14 years 7 months ago

Linear Complementarity Algorithms for Infinite Games

Download www.sofsem.cz

John Fearnley, Marcin Jurdzinski, Rahul Savani

Real-time Traffic

SOFSEM 2010 | Theoretical Computer Science |

claim paper

Related Content

» A Simple PMatrix Linear Complementarity Problem for Discounted Games

» Linear Complementarity and PMatrices for Stochastic Games

» Computing BestResponse Strategies in Infinite Games of Incomplete Information

» Fast algorithms for finding randomized strategies in game trees

» Playing games with approximation algorithms

Post Info
More Details (n/a)

Added	17 Mar 2010
Updated	17 Mar 2010
Type	Conference
Year	2010
Where	SOFSEM
Authors	John Fearnley, Marcin Jurdzinski, Rahul Savani

Comments (0)