( en | de | ru )

 

Disambiguation of "Kontogiannis, Spyros C."

Author of the publication

copydeleteadd this publication to your clipboard
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.

, , and . WAOA, volume 3879 of Lecture Notes in Computer Science, page 161-175. Springer, (2005)

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 Kritsikis

Spyros Thiveos

Spyros Krivas

Spyros Vassilas

 

Other publications of authors with the same name

Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines.. STOC, page 124-133. ACM, (2002)"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments., , , and . SPAA, page 37-46. ACM, (1998)Approximations of Bimatrix Nash Equilibria., , and . Encyclopedia of Algorithms, Springer, (2008)Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 596-608. Springer, (2007)Distance Oracles for Time-Dependent Networks., and . CoRR, (2013)Recent Advances in Approximability of Bimatrix Nash., , and . Bulletin of the EATCS, (2009)The Contribution of Game Theory to Complex Systems., and . Panhellenic Conference on Informatics, volume 3746 of Lecture Notes in Computer Science, page 101-111. Springer, (2005)Equilibrium Points in Fear of Correlated Threats., and . WINE, volume 5385 of Lecture Notes in Computer Science, page 210-221. Springer, (2008)Polynomial algorithms for approximating Nash equilibria of bimatrix games., , and . Theor. Comput. Sci., 410 (17): 1599-1606 (2009)Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations., , , and . ATMOS, volume 75 of OASIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)