George Christodoulou

According to our database1, George Christodoulou authored at least 43 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
On the Nisan-Ronen conjecture for submodular valuations.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
The Price of Stability of Weighted Congestion Games.
SIAM J. Comput., 2019

Designing Networks with Good Equilibria under Uncertainty.
SIAM J. Comput., 2019

Designing Cost-Sharing Methods for Bayesian Games.
Theory Comput. Syst., 2019

Impartial Selection with Additive Approximation Guarantees.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

2018
On the Efficiency of All-Pay Mechanisms.
Algorithmica, 2018

Strategic Contention Resolution in Multiple Channels.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

An Improved Envy-Free Cake Cutting Protocol for Four Agents.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
An Improved Upper Bound for the Universal TSP on the Grid.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Cost-Sharing Methods for Scheduling Games under Uncertainty.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Price of Anarchy.
Encyclopedia of Algorithms, 2016

Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions.
ACM Trans. Economics and Comput., 2016

Price of Stability in Polynomial Congestion Games.
ACM Trans. Economics and Comput., 2016

On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources.
Theory Comput. Syst., 2016

Bayesian Combinatorial Auctions.
J. ACM, 2016

Strategic Contention Resolution with Limited Feedback.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Social Welfare in One-Sided Matching Mechanisms.
Proceedings of the Autonomous Agents and Multiagent Systems - AAMAS 2016 Workshops, - Best Papers, 2016

Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Mechanisms for Scheduling with Single-Bit Private Values.
Theory Comput. Syst., 2015

Welfare Ratios in One-Sided Matching Mechanisms.
CoRR, 2015

Universal Network Cost-Sharing Design.
CoRR, 2015

2014
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms.
Algorithmica, 2014

Contention Resolution under Selfishness.
Algorithmica, 2014

2013
A truthful constant approximation for maximizing the minimum load on related machines.
Theor. Comput. Sci., 2013

A Deterministic Truthful PTAS for Scheduling Related Machines.
SIAM J. Comput., 2013

2012
Convergence and approximation in potential games.
Theor. Comput. Sci., 2012

2011
On the Performance of Approximate Equilibria in Congestion Games.
Algorithmica, 2011

A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010
Mechanism design for fractional scheduling on unrelated machines.
ACM Trans. Algorithms, 2010

Truthful Mechanisms for Exhibitions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

2009
Coordination mechanisms.
Theor. Comput. Sci., 2009

Mechanism Design for Scheduling.
Bull. EATCS, 2009

A Lower Bound for Scheduling Mechanisms.
Algorithmica, 2009

On the Price of Stability for Undirected Network Design.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008
Price of Anarchy.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Characterization of 2-Player Mechanisms for Scheduling.
Proceedings of the Algorithms, 2008

2007
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2005
The price of anarchy of finite congestion games.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.
Proceedings of the Algorithms, 2005


  Loading...