Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
SOFSEM
2010
Springer
favorite
Email
discuss
report
107
views
Theoretical Computer Science
»
more
SOFSEM 2010
»
Linear Complementarity Algorithms for Infinite Games
14 years 5 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision