Spyros Kontogiannis

Journals

• S. Kontogiannis, P. Spirakis. Well Supported Approximate Equilibria in Bimatrix Games. In ALGORITHMICA, 57(4): 653–667 (2010).
• S. Kontogiannis, P. Spirakis. On the Support Size of Stable Strategies in Random Games. Theoretical Computer Science (TCSA) 410(810): 933–942 (2009).
• S. Kontogiannis, P. Panagopoulou, P. Spirakis. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Theoretical Computer Science (TCSA), 410(17): 1599– 1606 (2009).
• D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis. The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. Theoretical Computer Science (TCSA), 410(36): 3305–3326 (2009).
• D. Fotakis, S. Kontogiannis, P. Spirakis. Atomic Congestion Games among Coalitions. ACM Transactions on Algorithms (TALG), 27 pages, 4(4): Article 52 (2008).
• D. Fotakis, S. Kontogiannis, P. Spirakis. Selfish Unsplittable Flows. Theoretical Computer Science (TCSA), 348(23): 226–239 (2005).
• S. Kontogiannis, G. Pantziou, P. Spirakis, M. Yung. Robust Parallel Computations through Randomization. Theory of Computing Systems (TOCS), 33(5/6): 427–464 (2000).

Conferences

• S. Kontogiannis, P. Spirakis. Approximability of Bimatrix Games and related experiments. In 10th int. Symp. on Experimental Algorithms (SEA2011), LNCS6630, Springer, pp. 1–20, 2011.
• A. Bessas, S. Kontogiannis, C. Zaroliagis. Robust Line Planning in case of Multiple Pools and Disruptions. In 1st int. ICST Conf. on Theory and Practice of Algorithms in (Computer) Systems, LNCS6595, Springer, pp. 33–44, 2011.
• S. Kontogiannis, P. Spirakis. Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Classes. In 13th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX2010), LNCS6302, pp. 312–325, 2010.
• S. Kontogiannis, P. Spirakis. Equilibrium Points in Fear of Correlated Threats. In 4th int. Workshop on Internet & Network Economics (WINE2008), LNCS5385, pp. 210–221, 2008.
• S. Kontogiannis, P. Spirakis. Foundations of Economics and Web Science. Invited paper in 12th PanHellenic Conf. on Informatics (PCI2008), 10 pages, 2008.
• S. Kontogiannis, C. Zaroliagis. Robust Line Planning under Unknown Incentives and Elasticity of Frequencies. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS2008), 16 pages, 2008.
• S. Kontogiannis, P. Spirakis. Probabilistic Techniques in Algorithmic Game Theory. Invited paper in 4th Symp. on Stochastic Algorithms, Foundations, and Applications (SAGA2007), LNCS4665, pp. 30–53, 2007.
• S. Kontogiannis, P. Spirakis. On the Support Size of Stable Strategies in Random Games. In 4th Symp. on Stochastic Algorithms, Foundations, and Applications (SAGA2007), LNCS4665, pp. 154–165, 2007.
• S. Kontogiannis, P. Spirakis. Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. In 32nd int. Symp. on Mathematical Foundations of Computer Science (MFCS2007), LNCS4708, pp. 596–608, 2007.
• S. Kontogiannis, P. Spirakis. Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. In 34th int. Col. on Automata, Languages and Progr. (ICALP2007 – TRACK A), LNCS4596, pp. 595–606, 2007.
• S. Kontogiannis, P. Panagopoulou, P. Spirakis. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. In 2nd int. Workshop on Internet & Network Economics (WINE2006), LNCS4286, pp. 286–296, 2006.
• D. Fotakis, S. Kontogiannis, P. Spirakis. Atomic Congestion Games among Coalitions. In 33rd int. Col. on Automata, Languages and Progr. (ICALP2006 – TRACK A), LNCS4051, pp. 572–583, 2006.
• D. Fotakis, S. Kontogiannis, P. Panagopoulou, C. Raptopoulos, P. Spirakis. Algorithmic Issues in Coalitional and Dynamic Network Games. In 6th int. Heinz Nixdorf Symp. on New Trends in Parallel & Distributed Computing, pp. 25–42, 2006.
• S. Kontogiannis, P. Spirakis. Counting Stable Strategies in Random Evolutionary Games. In 16th int. Symp. on Algorithms and Computation (ISAAC2005), LNCS3827, pp. 839–848, 2005.
• S. Kontogiannis, P. Spirakis. Atomic Selfish Routing in Networks: A Survey. In 1st int. Workshop on Internet & Network Economics (WINE2005), LNCS3828, pp. 989–1002, 2005.
• S. Kontogiannis, P. Spirakis. The Contribution of Game Theory to Complex Systems. In 10th Panhellenic Conf. of Informatics (PCI2005), LNCS3746, pp. 101–111, 2005.
• D. Fotakis, S. Kontogiannis, P. Spirakis. Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In 3rd Workshop on Approximation and Online Algorithms (WAOA2005), LNCS3879, pp. 161–175, 2005.
• S. Kontogiannis, P. Spirakis. Evolutionary Games: An Algorithmic View. In int. Workshop on SelfStar Properties in Complex Information Systems, LNCS3460, pp. 97–111, 2004.
• D. Fotakis, S. Kontogiannis, P. Spirakis. Selfish Unsplittable Flows. In 31st int. Col. on Automata, Languages and Progr. (ICALP2004 – TRACK A), LNCS3142, pp. 593–605, 2004.
• D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis. The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In 29th int. Col. on Automata, Languages and Progr. (ICALP2002 – TRACK A), LNCS2380, pp. 123–134, 2002.
• S. Kontogiannis. Lower Bounds & Competitive Algorithms for Online Scheduling of UnitSize Tasks to Related Machines. In 34th ACM Symp. on Theory of Computing (STOC2002), pp. 124–133, 2002
• S. Kontogiannis, G. Pantziou, P. Spirakis and M. Yung. ’’Dynamicfaultprone BSP’’: a paradigm for robust computations in changing environments. In 10th ACM Symp. on Parallel Algorithms and Architectures (SPAA1998), pp. 37–46, 1998.
• S. Kontogiannis, G. Pantziou, P. Spirakis. Efficient computations on faultprone BSP machines. In 9th ACM Symp. on Parallel Algorithms and Architectures (SPAA1997), pp. 84–93, 1997.