Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Spyros C. Kontogiannis
2010 – today
- 2013
[j11]Spyros C. Kontogiannis, Elias Koutsoupias, Pavlos G. Spirakis: Preface to Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 53(1): 1-2 (2013)- 2012
- [j10]Spyros C. Kontogiannis, Paul G. Spirakis: On mutual concavity and strategically-zero-sum bimatrix games. Theor. Comput. Sci. 432: 64-76 (2012)
- 2011
- [c22]Alberto Caprara, Spyros C. Kontogiannis: Frontmatter, Table of Contents, Preface, Workshop Organization. ATMOS 2011
- [c21]Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis: Robust Line Planning in Case of Multiple Pools and Disruptions. TAPAS 2011: 33-44
- [c20]Spyros C. Kontogiannis, Paul G. Spirakis: Approximability of Symmetric Bimatrix Games and Related Experiments. SEA 2011: 1-20
- [e3]Alberto Caprara, Spyros C. Kontogiannis (Eds.): ATMOS 2011 - 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Saarbrücken, Germany, September 8, 2011. OASICS 20, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2011, ISBN 978-3-939897-33-0
- [i2]Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis: Robust Line Planning in case of Multiple Pools and Disruptions. CoRR abs/1101.2770 (2011)
- 2010
- [j9]Spyros C. Kontogiannis, Paul G. Spirakis: Well Supported Approximate Equilibria in Bimatrix Games. Algorithmica 57(4): 653-667 (2010)
- [c19]Spyros C. Kontogiannis, Paul G. Spirakis: Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. APPROX-RANDOM 2010: 312-325
- [e2]Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis (Eds.): Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings. Lecture Notes in Computer Science 6386, Springer 2010, ISBN 978-3-642-16169-8
2000 – 2009
- 2009
- [j8]Spyros C. Kontogiannis, Paul G. Spirakis, Haralampos Tsaknakis: Recent Advances in Approximability of Bimatrix Nash. Bulletin of the EATCS 98: 60-77 (2009)
- [j7]Spyros C. Kontogiannis, Paul G. Spirakis: On the support size of stable strategies in random games. Theor. Comput. Sci. 410(8-10): 933-942 (2009)
- [j6]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis: Preface. Theor. Comput. Sci. 410(17): 1551 (2009)
- [j5]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Polynomial algorithms for approximating Nash equilibria of bimatrix games. Theor. Comput. Sci. 410(17): 1599-1606 (2009)
- [j4]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009)
- [p1]Apostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis: Incentive-Compatible Robust Line Planning. Robust and Online Large-Scale Optimization 2009: 85-118
- 2008
- [j3]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic congestion games among coalitions. ACM Transactions on Algorithms 4(4) (2008)
- [c18]Spyros C. Kontogiannis, Christos D. Zaroliagis: Robust Line Planning under Unknown Incentives and Elasticity of Frequencies. ATMOS 2008
- [c17]Spyros C. Kontogiannis, Paul G. Spirakis: Equilibrium Points in Fear of Correlated Threats. WINE 2008: 210-221
- [r2]Spyros C. Kontogiannis: Computing Pure Equilibria in the Game of Parallel Links. Encyclopedia of Algorithms 2008
- [r1]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Approximations of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008
- 2007
- [c16]Spyros C. Kontogiannis, Paul G. Spirakis: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. ICALP 2007: 595-606
- [c15]Spyros C. Kontogiannis, Paul G. Spirakis: Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. MFCS 2007: 596-608
- [c14]Spyros C. Kontogiannis, Paul G. Spirakis: Probabilistic Techniques in Algorithmic Game Theory. SAGA 2007: 30-53
- [c13]Spyros C. Kontogiannis, Paul G. Spirakis: On the Support Size of Stable Strategies in Random Games. SAGA 2007: 154-165
- 2006
- [c12]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Atomic Congestion Games Among Coalitions. ICALP (1) 2006: 572-583
- [c11]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE 2006: 286-296
- [e1]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis (Eds.): Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings. Lecture Notes in Computer Science 4286, Springer 2006, ISBN 3-540-68138-8
- [i1]Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis: Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Electronic Colloquium on Computational Complexity (ECCC) 13(081) (2006)
- 2005
- [j2]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish unsplittable flows. Theor. Comput. Sci. 348(2-3): 226-239 (2005)
- [c10]Spyros C. Kontogiannis, Paul G. Spirakis: Evolutionary Games: An Algorithmic View. Self-star Properties in Complex Information Systems 2005: 97-111
- [c9]Spyros C. Kontogiannis, Paul G. Spirakis: Counting Stable Strategies in Random Evolutionary Games. ISAAC 2005: 839-848
- [c8]Spyros C. Kontogiannis, Paul G. Spirakis: The Contribution of Game Theory to Complex Systems. Panhellenic Conference on Informatics 2005: 101-111
- [c7]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. WAOA 2005: 161-175
- [c6]Spyros C. Kontogiannis, Paul G. Spirakis: Atomic Selfish Routing in Networks: A Survey. WINE 2005: 989-1002
- 2004
- [c5]Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis: Selfish Unsplittable Flows. ICALP 2004: 593-605
- 2002
- [c4]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134
- [c3]Spyros C. Kontogiannis: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines. STOC 2002: 124-133
- 2000
- [j1]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung: Robust Parallel Computations through Randomization. Theory Comput. Syst. 33(5/6): 427-464 (2000)
1990 – 1999
- 1998
- [c2]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung: ``Dynamic-Fault-Prone BSP'': A Paradigm for Robust Computations in Changing Environments. SPAA 1998: 37-46
- 1997
- [c1]Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis: Efficient Computations on Fault-Prone BSP Machines. SPAA 1997: 84-93
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-01 22:19 CEST by the dblp team