Travelled to:1 × Canada
1 × Denmark
1 × Finland
1 × Italy
1 × Poland
1 × Spain
Collaborated with:P.G.Spirakis D.Fotakis C.D.Zaroliagis ∅ E.Koutsoupias M.Mavronicolas
Talks about:game (3) equilibria (2) algorithm (2) selfish (2) unsplitt (1) structur (1) constant (1) competit (1) bimatrix (1) approxim (1)
Person: Spyros C. Kontogiannis
DBLP: Kontogiannis:Spyros_C=
Contributed to:
20142007200620042002
2002Wrote 6 papers:
- ICALP-v1-2014-KontogiannisZ #distance #network
- Distance Oracles for Time-Dependent Networks (SCK, CDZ), pp. 713–725.
- ICALP-2007-KontogiannisS #algorithm #approximate #constant #game studies #performance
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.
- ICALP-v1-2006-FotakisKS #game studies
- Atomic Congestion Games Among Coalitions (DF, SCK, PGS), pp. 572–583.
- ICALP-2004-FotakisKS
- Selfish Unsplittable Flows (DF, SCK, PGS), pp. 593–605.
- ICALP-2002-FotakisKKMS #complexity #game studies #nash
- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (DF, SCK, EK, MM, PGS), pp. 123–134.
- STOC-2002-Kontogiannis #algorithm #bound #online #scheduling
- Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines (SCK), pp. 124–133.