( en | de | ru )

 

Disambiguation of "Kontogiannis, Spyros C."

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial algorithms for approximating Nash equilibria of bimatrix games.

, , and . Theor. Comput. Sci., 410 (17): 1599-1606 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Spyros Rammos

Spyros Thiveos

Spyros Kritsikis

Spyros Krivas

Spyros Vassilas

 

Other publications of authors with the same name

On the support size of stable strategies in random games., and . Theor. Comput. Sci., 410 (8-10): 933-942 (2009)On mutual concavity and strategically-zero-sum bimatrix games., and . Theor. Comput. Sci., (2012)A Glimpse at Paul G. Spirakis., , , , , , and . Algorithms, Probability, Networks, and Games, volume 9295 of Lecture Notes in Computer Science, page 3-24. Springer, (2015)Analysis and Experimental Evaluation of Time-Dependent Distance Oracles., , , , , and . ALENEX, page 147-158. SIAM, (2015)A Cloud-Based Time-Dependent Routing Service., , , and . ALGOCLOUD, volume 10230 of Lecture Notes in Computer Science, page 41-64. (2016)Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games., and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 595-606. Springer, (2007)Improved Oracles for Time-Dependent Road Networks., , , , and . ATMOS, volume 59 of OASIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Frontmatter, Table of Contents, Preface, Workshop Organization., and . ATMOS, volume 20 of OASIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2011)Computing Pure Equilibria in the Game of Parallel Links.. Encyclopedia of Algorithms, Springer, (2008)Robust Parallel Computations through Randomization., , , and . Theory Comput. Syst., 33 (5/6): 427-464 (2000)