On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. - George Christodoulou 001; Elias Koutsoupias (ESA, 2005)

The price of anarchy of finite congestion games. - George Christodoulou 001; Elias Koutsoupias (STOC, 2005)

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. - George Christodoulou 001; Laurent Gourvès; Fanny Pascual (COCOON, 2007)

A Characterization of 2-Player Mechanisms for Scheduling. - George Christodoulou 001; Elias Koutsoupias; Angelina Vidali (ESA, 2008)

Price of Anarchy. - George Christodoulou 001 (Encyclopedia of Algorithms, 2008)

On the Price of Stability for Undirected Network Design. - George Christodoulou 001; Christine Chung 001; Katrina Ligett; Evangelia Pyrga; Rob van Stee (WAOA, 2009)

A Lower Bound for Scheduling Mechanisms. - George Christodoulou 001; Elias Koutsoupias; Angelina Vidali (Algorithmica, 2009)

Mechanism Design for Scheduling. - George Christodoulou 001; Elias Koutsoupias (Bull. EATCS, 2009)

Coordination mechanisms. - George Christodoulou 001; Elias Koutsoupias; Akash Nanavati (Theor. Comput. Sci., 2009)

Truthful Mechanisms for Exhibitions. - George Christodoulou 001; Khaled M. Elbassioni; Mahmoud Fouz (WINE, 2010)

Mechanism design for fractional scheduling on unrelated machines. - George Christodoulou 001; Elias Koutsoupias; Annamária Kovács (ACM Trans. Algorithms, 2010)

A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks. - George Christodoulou 001; Annamária Kovács (WINE, 2011)

On the Performance of Approximate Equilibria in Congestion Games. - George Christodoulou 001; Elias Koutsoupias; Paul G. Spirakis (Algorithmica, 2011)

Convergence and approximation in potential games. - George Christodoulou 001; Vahab S. Mirrokni; Anastasios Sidiropoulos (Theor. Comput. Sci., 2012)

A Deterministic Truthful PTAS for Scheduling Related Machines. - George Christodoulou 001; Annamária Kovács (SIAM J. Comput., 2013)

A truthful constant approximation for maximizing the minimum load on related machines. - George Christodoulou 001; Annamária Kovács; Rob van Stee (Theor. Comput. Sci., 2013)

Contention Resolution under Selfishness. - George Christodoulou 001; Katrina Ligett; Evangelia Pyrga (Algorithmica, 2014)

Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. - Giorgos Christodoulou 001; Kurt Mehlhorn; Evangelia Pyrga (Algorithmica, 2014)

Universal Network Cost-Sharing Design. - George Christodoulou 001; Alkmini Sgouritsa (CoRR, 2015)

Welfare Ratios in One-Sided Matching Mechanisms. - George Christodoulou 001; Aris Filos-Ratsikas; Søren Kristoffer Stiil Frederiksen; Paul W. Goldberg; Jie Zhang 008; Jinshan Zhang 001 (CoRR, 2015)

Mechanisms for Scheduling with Single-Bit Private Values. - Vincenzo Auletta; George Christodoulou 001; Paolo Penna (Theory Comput. Syst., 2015)

Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract). - George Christodoulou 001; Aris Filos-Ratsikas; Søren Kristoffer Stiil Frederiksen; Paul W. Goldberg; Jie Zhang 008; Jinshan Zhang 001 (AAMAS, 2016)

Social Welfare in One-Sided Matching Mechanisms. - George Christodoulou 001; Aris Filos-Ratsikas; Søren Kristoffer Stiil Frederiksen; Paul W. Goldberg; Jie Zhang 008; Jinshan Zhang 001 (AAMAS Workshops (Selected Papers), 2016)

Strategic Contention Resolution with Limited Feedback. - George Christodoulou 001; Martin Gairing; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (ESA, 2016)

Bayesian Combinatorial Auctions. - George Christodoulou 001; Annamária Kovács; Michael Schapira (J. ACM, 2016)

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. - George Christodoulou 001; Alkmini Sgouritsa; Bo Tang 010 (Theory Comput. Syst., 2016)

Price of Stability in Polynomial Congestion Games. - George Christodoulou 001; Martin Gairing (ACM Trans. Economics and Comput., 2016)

Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions. - George Christodoulou 001; Annamária Kovács; Alkmini Sgouritsa; Bo Tang 010 (ACM Trans. Economics and Comput., 2016)

Price of Anarchy. - George Christodoulou 001 (Encyclopedia of Algorithms, 2016)

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. - George Christodoulou 001; Martin Gairing; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (SAGT, 2017)

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. - Georgios Amanatidis; Georgios Birmpas; George Christodoulou 001; Evangelos Markakis (EC, 2017)

Cost-Sharing Methods for Scheduling Games under Uncertainty. - Giorgos Christodoulou 001; Vasilis Gkatzelis; Alkmini Sgouritsa (EC, 2017)

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. - George Christodoulou 001; Themistoklis Melissourgos; Paul G. Spirakis (SAGT, 2018)

An Improved Envy-Free Cake Cutting Protocol for Four Agents. - Georgios Amanatidis; George Christodoulou 001; John Fearnley; Evangelos Markakis; Christos-Alexandros Psomas; Eftychia Vakaliou (SAGT, 2018)

Strategic Contention Resolution in Multiple Channels. - George Christodoulou 001; Themistoklis Melissourgos; Paul G. Spirakis (WAOA, 2018)

On the Efficiency of All-Pay Mechanisms. - George Christodoulou 001; Alkmini Sgouritsa; Bo Tang 010 (Algorithmica, 2018)

Designing Cost-Sharing Methods for Bayesian Games. - George Christodoulou 001; Stefano Leonardi 001; Alkmini Sgouritsa (Theory Comput. Syst., 2019)

Designing Networks with Good Equilibria under Uncertainty. - George Christodoulou 001; Alkmini Sgouritsa (SIAM J. Comput., 2019)

The Price of Stability of Weighted Congestion Games. - George Christodoulou 001; Martin Gairing; Yiannis Giannakopoulos; Paul G. Spirakis (SIAM J. Comput., 2019)

Resource-Aware Protocols for Network Cost-Sharing Games. - George Christodoulou 001; Vasilis Gkatzelis; Mohamad Latifian; Alkmini Sgouritsa (EC, 2020)

On the Nisan-Ronen conjecture for submodular valuations. - George Christodoulou 001; Elias Koutsoupias; Annamária Kovács (STOC, 2020)

Introduction to the Special Issue on WINE'18: Part 1. - Giorgos Christodoulou 001; Tobias Harks (ACM Trans. Economics and Comput., 2021)

Introduction to the Special Issue on WINE'18: Part 2. - Giorgos Christodoulou 001; Tobias Harks (ACM Trans. Economics and Comput., 2021)

Optimal Deterministic Clock Auctions and Beyond. - Giorgos Christodoulou 001; Vasilis Gkatzelis; Daniel Schoepflin 001 (ITCS, 2022)

Impartial Selection with Additive Approximation Guarantees. - Ioannis Caragiannis; George Christodoulou 001; Nicos Protopapas (Theory Comput. Syst., 2022)

On the nisan-ronen conjecture. - George Christodoulou 001; Elias Koutsoupias; Annamária Kovács (SIGecom Exch., 2022)

A Proof of the Nisan-Ronen Conjecture. - George Christodoulou 001 (SAGT, 2023)

Fair allocation in graphs. - George Christodoulou 001; Amos Fiat; Elias Koutsoupias; Alkmini Sgouritsa (EC, 2023)

A Proof of the Nisan-Ronen Conjecture. - George Christodoulou 001; Elias Koutsoupias; Annamária Kovács (STOC, 2023)

Impartial Selection with Prior Information. - Ioannis Caragiannis; George Christodoulou 001; Nicos Protopapas (WWW, 2023)

A Proof of the Nisan-Ronen Conjecture - An Overview. - George Christodoulou 001; Elias Koutsoupias; Annamária Kovács (SIGecom Exch., 2023)

Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. - George Christodoulou 001; Martin Gairing; Yiannis Giannakopoulos; Diogo Poças; Clara Waldmann (Math. Oper. Res., 2023)

Mechanism design augmented with output advice. - George Christodoulou 001; Alkmini Sgouritsa; Ioannis Vlachos 002 (NeurIPS, 2024)

Truthful aggregation of budget proposals with proportionality guarantees. - Ioannis Caragiannis; George Christodoulou 001; Nicos Protopapas (Artif. Intell., 2024)

Resource-Aware Cost-Sharing Methods for Scheduling Games. - George Christodoulou 001; Vasilis Gkatzelis; Alkmini Sgouritsa (Oper. Res., 2024)

An Improved Upper Bound for the Universal TSP on the Grid. - George Christodoulou 001; Alkmini Sgouritsa (SIAM J. Comput., 2024)

Fair and truthful allocations under leveled valuations. - George Christodoulou 001; Vasilis Christoforidis (Inf. Process. Lett., 2025)

Maximin Share Guarantees for Few Agents with Subadditive Valuations. - George Christodoulou 001; Vasilis Christoforidis; Symeon Mastrakoulis; Alkmini Sgouritsa (CoRR, 2025)

Exact and approximate maximin share allocations in multi-graphs. - George Christodoulou 001; Symeon Mastrakoulis (CoRR, 2025)

Truthful Allocation in Graphs and Hypergraphs. - George Christodoulou 001; Elias Koutsoupias; Annamária Kovács (ACM Trans. Economics and Comput., 2025)

Improving the Price of Anarchy via Predictions in Parallel-Link Networks. - George Christodoulou 001; Vasilis Christoforidis; Alkmini Sgouritsa; Ioannis Vlachos 002 (CoRR, 2025)