Research Interests
    
•      Algorithmic Game Theory, Inefficiency of equilibria, Algorithmic Mechanism Design,
          Online Algorithms, Approximation Algorithms
 
University of Liverpool
Department of Computer Science
Ashton Builiding, Ashton Street
Liverpool L69 3BX
U.K.
gchristo “at” liv.ac.uk
 
Publications
                                                                                
    •     An Improved Upper Bound for the Universal TSP on the Grid. [PDF]  
George Christodoulou, Alkmini Sgouritsa.  
SODA 2017
    •     Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions. [PDF]  
George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang.  
ACM TEAC 2016
    •     Strategic Contention Resolution with Limited Feedback. [PDF]  
George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis.  
ESA 2016
    •     Designing Cost-Sharing Methods for Bayesian Games. [PDF]  
George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa.  
SAGT 2016
    •     Designing Networks with Good Equilibria under Uncertainty. [PDF]  
George Christodoulou, Alkmini Sgouritsa.  
SODA 2016
    •     On the Efficiency of All-Pay Mechanisms. [PDF]  
George Christodoulou, Alkmini Sgouritsa, Bo Tang.  
ESA 2015
    •     On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. [PDF]  
George Christodoulou, Alkmini Sgouritsa, Bo Tang.  
SAGT 2015, TOCS (Special Issue)
    •     Price of Stability in Polynomial Congestion Games. [PDF]  
George Christodoulou, Martin Gairing.  
ICALP 2013, ACM TEAC 2016
    •     Mechanisms for Scheduling with Single-Bit Private Values. [PDF]  
Vincenzo Auletta, George Christodoulou, Paolo Penna.  
SAGT 2012, TOCS 2015 (Special Issue)
    •    A Global Characterization of Envy-free Truthful Scheduling of Two Tasks. [PDF]  
George Christodoulou, Annamaria Kovacs.  
WINE 2011
    •    Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. [PDF]  
George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga .  
ESA 2011, Algorithmica 2014
    •    A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.
George Christodoulou, Annamaria Kovacs, Rob van Stee.
WINE 2010, TCS 2013
    •    Truthful Mechanisms for Exhibitions.
George Christodoulou, Khaled Elbassioni, Mahmoud Fouz. [
PDF, ]
WINE 2010
    •    Contention Resolution under Selfishness.
George Christodoulou, Katrina Ligett, Evangelia Pyrga.  
ICALP 2010, Algorithmica 2014  
    •    A deterministic truthful PTAS for scheduling related machines. [PDF]  
George Christodoulou, Annamaria Kovacs.  
SODA 2010
    •    On the Price of Stability for Undirected Network Design.
George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee.  
WAOA 2009
    •    On the performance of approximate equilibria in congestion games. [ PDF ]
George Christodoulou, Elias Koutsoupias, Paul Spirakis.  
In Proc. of the 17th Annual European Symposium (ESA 2009).
    •    Mechanism Design for Scheduling. [ PDF ]
George Christodoulou, Elias Koutsoupias.  
In Bulletin of the European Association for Theoretical Computer Science (BEATCS), 97:3959,
          February 2009.
    •    A characterization of 2-player mechanisms for scheduling. [ PDF ]
George Christodoulou, Elias Koutsoupias, Angelina Vidali.  
In Proc. of the 16th Annual European Symposium (ESA 2008).
    •    Bayesian Combinatorial Auctions. [ PDF ]
George Christodoulou, Annamaria Kovacs, Michael Schapira.
In Proceedings of Automata, Languages and Programming: 35th International Colloquium
          ICALP 2008, JACM 2016.
    •    Scheduling selfish tasks: about the performance of truthful algorithms. [ PDF ]
George Christodoulou, Laurent Gourves, Fanny Pascual.
In Proceedings of the 13th Annual International Computing and Combinatorics Conference
          (COCOON 2007).
    •    Mechanism Design for fractional scheduling on unrelated machines. [ PDF ]
George Christodoulou, Elias Koutsoupias, Annamaria Kovacs.
In Proceedings of Automata, Languages and Programming: 34th International Colloquium
          (ICALP 2007).  
    •    A lower bound for scheduling mechanisms. [ PDF ]
George Christodoulou, Elias Koutsoupias, Angelina Vidali.
In ACM-SIAM Symposium on Discrete Algorithms (SODA 2007).  
    •    Convergence and Approximation in Potential Games. [ PDF ]
George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos.
In Proc. of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS 2006).  
    •    On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.[PDF]
George Christodoulou, Elias Koutsoupias.
In Proc. of the 13th Annual European Symposium (ESA 2005). ]
    •    The Price of Anarchy of Finite Congestion Games. [ PDF ]
George Christodoulou, Elias Koutsoupias.
In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005)  
    •    Coordination Mechanisms. [ PDF ]
George Christodoulou, Elias Koutsoupias, Akash Nanavati.
In Proc. of Automata, Languages and Programming: 31st International Colloquium
          (ICALP 2004).
    •    On-line Maximum Independent Set in Chordal Graphs. [ PDF ]
George Christodoulou, Vassilis Zissimopoulos.
Journal of Foundations of Computing and Decision Sciences, Vol. 30, No 4, 2005.  
    •    Crew Assignment by Constraint Logic Programming. [ PDF ]
George Christodoulou, Panagiotis Stamatopoulos.
In Proceedings of the 2nd Hellenic Conference on Artificial Intelligence SETN-2002 (Companion Volume)
 
•       Spring 2011: Computational Auctions and Mechanism Design
•       Summer 2008: Internet Economics

Programme Committees
 
 
Teaching