- Probabilistic Techniques in Algorithmic Game Theory
- Atomic Congestion Games among Coalitions # Dimitris Fotakis 1 , Spyros Kontogiannis 2,3 , and Paul Spirakis 3
- Selfish Unsplittable Flows # Dimitris Fotakis 1,2 , Spyros Kontogiannis 1,3 , and Paul Spirakis 1
- Well Supported Approximate Equilibria in Bimatrix Games
- The Contribution of Game Theory to Complex Systems Spyros Kontogiannis1,2
- Lower Bounds & Competitive Algorithms for Online Scheduling of UnitSize Tasks to Related Machines
- Atomic Selfish Routing in Networks: A Survey # Spyros Kontogiannis 1,2 and Paul Spirakis 2
- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
- ## ######### Y########### ############ ######## X. ############
- The Structure and Complexity of Nash Equilibria for a Sel sh Routing Game ?
- A Frame for the Simulation of Shared Memory on Distributed Memory
- Let \Xi i be the number of pending threads that P i contests for. Then 8'' 2 (0; 1); \Xi i 2
- On Mutual Concavity and Strategically Zero-Sum Games
- Efficient Computations on faultprone BSP machines \Lambda Spyros C. Kontogiannis y;x Grammati E. Pantziou x Paul G. Spirakis y; x
- Atomic Selfish Routing in Networks: A Survey Spyros Kontogiannis,
- Atomic Congestion Games among Coalitions # Dimitris Fotakis 1 , Spyros Kontogiannis 2,3 , and Paul Spirakis 3
- Equilibrium Points in Fear of Correlated Threats
- Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
- Efficient Algorithms for Constant Well Supported Approximate
- On the Support Size of Stable Strategies in Random Games
- Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
- Counting Stable Strategies in Random Evolutionary Games
- Atomic Selfish Routing in Networks: A Survey Spyros Kontogiannis1,2
- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
- Exploiting Concavity in Bimatrix Games: New polynomially tractable subclasses
- Foundations of Economics and Web Science * Spyros Kontogiannisa
