default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge Christodoulou 0001
Giorgos Christodoulou 0001
Person information
- affiliation: Aristotle University of Thessaloniki, School of Informatics, Kalamaria, Greece
- affiliation: University of Liverpool
Other persons with the same name
- George Christodoulou 0002 — University of Cyprus
- George Christodoulou 0003 — Technical University of Crete, Greece
- George Christodoulou 0004 — Technological Educational Institute of Thessaloniki, Greece
- George Christodoulou 0005
![[0000-0002-2104-565X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-2104-565X")
— Delft University of Technology, The Netherlands (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i27]George Christodoulou, Vasilis Christoforidis, Symeon Mastrakoulis, Alkmini Sgouritsa:
Maximin Share Guarantees for Few Agents with Subadditive Valuations. CoRR abs/2502.05141 (2025)- 2024
- [j28]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Truthful aggregation of budget proposals with proportionality guarantees. Artif. Intell. 335: 104178 (2024) - [j27]George Christodoulou, Vasilis Gkatzelis, Alkmini Sgouritsa:
Resource-Aware Cost-Sharing Methods for Scheduling Games. Oper. Res. 72(1): 167-184 (2024) - [j26]George Christodoulou, Alkmini Sgouritsa:
An Improved Upper Bound for the Universal TSP on the Grid. SIAM J. Comput. 53(5): 1476-1523 (2024) - [c47]George Christodoulou, Alkmini Sgouritsa, Ioannis Vlachos:
Mechanism design augmented with output advice. NeurIPS 2024 - [i26]George Christodoulou, Alkmini Sgouritsa, Ioannis Vlachos:
Mechanism design augmented with output advice. CoRR abs/2406.14165 (2024) - [i25]George Christodoulou, Vasilis Christoforidis:
Fair and Truthful Allocations Under Leveled Valuations. CoRR abs/2407.05891 (2024) - 2023
- [j25]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. Math. Oper. Res. 48(1): 583-602 (2023) - [j24]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A Proof of the Nisan-Ronen Conjecture - An Overview. SIGecom Exch. 21(1): 42-48 (2023) - [c46]George Christodoulou:
A Proof of the Nisan-Ronen Conjecture. SAGT 2023: x - [c45]George Christodoulou, Amos Fiat, Elias Koutsoupias, Alkmini Sgouritsa:
Fair allocation in graphs. EC 2023: 473-488 - [c44]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A Proof of the Nisan-Ronen Conjecture. STOC 2023: 672-685 - [c43]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Prior Information. WWW 2023: 3614-3624 - [i24]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A proof of the Nisan-Ronen conjecture. CoRR abs/2301.11905 (2023) - 2022
- [j23]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. Theory Comput. Syst. 66(3): 721-742 (2022) - [j22]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the nisan-ronen conjecture. SIGecom Exch. 20(1): 41-46 (2022) - [c42]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Truthful Aggregation of Budget Proposals with Proportionality Guarantees. AAAI 2022: 4917-4924 - [c41]Giorgos Christodoulou, Vasilis Gkatzelis, Daniel Schoepflin:
Optimal Deterministic Clock Auctions and Beyond. ITCS 2022: 49:1-49:23 - [i23]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Truthful Aggregation of Budget Proposals with Proportionality Guarantees. CoRR abs/2203.09971 (2022) - 2021
- [j21]Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 1. ACM Trans. Economics and Comput. 9(1): 1:1 (2021) - [j20]Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 2. ACM Trans. Economics and Comput. 9(2): 8:1 (2021) - [c40]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. FOCS 2021: 839-850 - [c39]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful Allocation in Graphs and Hypergraphs. ICALP 2021: 56:1-56:20 - [i22]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial selection with prior information. CoRR abs/2102.09002 (2021) - [i21]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Truthful allocation in graphs and hypergraphs. CoRR abs/2106.03724 (2021) - 2020
- [c38]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. ICALP 2020: 32:1-32:18 - [c37]George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian, Alkmini Sgouritsa:
Resource-Aware Protocols for Network Cost-Sharing Games. EC 2020: 81-107 - [c36]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture for submodular valuations. STOC 2020: 1086-1096 - [i20]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. CoRR abs/2002.07466 (2020) - [i19]George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian, Alkmini Sgouritsa:
Resource-Aware Protocols for Network Cost-Sharing Games. CoRR abs/2007.03751 (2020) - [i18]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. CoRR abs/2011.14434 (2020)
2010 – 2019
- 2019
- [j19]George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. Theory Comput. Syst. 63(1): 4-25 (2019) - [j18]George Christodoulou, Alkmini Sgouritsa:
Designing Networks with Good Equilibria under Uncertainty. SIAM J. Comput. 48(4): 1364-1396 (2019) - [j17]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. SIAM J. Comput. 48(5): 1544-1582 (2019) - [c35]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. SAGT 2019: 269-283 - [i17]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture for submodular valuations. CoRR abs/1907.12733 (2019) - [i16]Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. CoRR abs/1910.00135 (2019) - 2018
- [j16]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of All-Pay Mechanisms. Algorithmica 80(4): 1115-1145 (2018) - [c34]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. ICALP 2018: 150:1-150:16 - [c33]Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. SAGT 2018: 87-99 - [c32]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. SAGT 2018: 245-250 - [c31]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. WAOA 2018: 165-180 - [e1]George Christodoulou, Tobias Harks:
Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings. Lecture Notes in Computer Science 11316, Springer 2018, ISBN 978-3-030-04611-8 [contents] - [i15]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. CoRR abs/1802.09952 (2018) - [i14]Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. CoRR abs/1807.00317 (2018) - [i13]George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. CoRR abs/1810.04565 (2018) - 2017
- [c30]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. SAGT 2017: 240-251 - [c29]Giorgos Christodoulou, Vasilis Gkatzelis, Alkmini Sgouritsa:
Cost-Sharing Methods for Scheduling Games under Uncertainty. EC 2017: 441-458 - [c28]Georgios Amanatidis, Georgios Birmpas, George Christodoulou, Evangelos Markakis:
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. EC 2017: 545-562 - [c27]George Christodoulou, Alkmini Sgouritsa:
An Improved Upper Bound for the Universal TSP on the Grid. SODA 2017: 1006-1021 - [i12]Georgios Amanatidis, Georgios Birmpas, George Christodoulou, Evangelos Markakis:
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. CoRR abs/1705.10706 (2017) - [i11]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis:
A 3-player protocol preventing persistence in strategic contention with limited feedback. CoRR abs/1707.01439 (2017) - 2016
- [j15]George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. J. ACM 63(2): 11:1-11:19 (2016) - [j14]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. Theory Comput. Syst. 59(4): 600-618 (2016) - [j13]George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang:
Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions. ACM Trans. Economics and Comput. 4(2): 9:1-9:33 (2016) - [j12]George Christodoulou, Martin Gairing:
Price of Stability in Polynomial Congestion Games. ACM Trans. Economics and Comput. 4(2): 10:1-10:17 (2016) - [c26]George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang:
Social Welfare in One-Sided Matching Mechanisms. AAMAS Workshops (Selected Papers) 2016: 30-50 - [c25]George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang:
Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract). AAMAS 2016: 1297-1298 - [c24]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Strategic Contention Resolution with Limited Feedback. ESA 2016: 30:1-30:16 - [c23]George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. SAGT 2016: 327-339 - [c22]George Christodoulou, Alkmini Sgouritsa:
Designing Networks with Good Equilibria under Uncertainty. SODA 2016: 72-89 - [r2]George Christodoulou:
Price of Anarchy. Encyclopedia of Algorithms 2016: 1611-1614 - [i10]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Strategic Contention Resolution with Limited Feedback. CoRR abs/1606.06580 (2016) - 2015
- [j11]Vincenzo Auletta, George Christodoulou, Paolo Penna:
Mechanisms for Scheduling with Single-Bit Private Values. Theory Comput. Syst. 57(3): 523-548 (2015) - [c21]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of All-Pay Mechanisms. ESA 2015: 349-360 - [c20]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. SAGT 2015: 165-177 - [i9]George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang:
Welfare Ratios in One-Sided Matching Mechanisms. CoRR abs/1502.03849 (2015) - [i8]George Christodoulou, Alkmini Sgouritsa:
Universal Network Cost-Sharing Design. CoRR abs/1503.03392 (2015) - [i7]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources. CoRR abs/1507.07011 (2015) - [i6]George Christodoulou, Alkmini Sgouritsa, Bo Tang:
On the Efficiency of All-Pay Mechanisms. CoRR abs/1508.01130 (2015) - 2014
- [j10]Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Algorithmica 69(3): 619-640 (2014) - [j9]George Christodoulou, Katrina Ligett, Evangelia Pyrga:
Contention Resolution under Selfishness. Algorithmica 70(4): 675-693 (2014) - 2013
- [j8]George Christodoulou, Annamária Kovács:
A Deterministic Truthful PTAS for Scheduling Related Machines. SIAM J. Comput. 42(4): 1572-1595 (2013) - [j7]George Christodoulou, Annamária Kovács, Rob van Stee:
A truthful constant approximation for maximizing the minimum load on related machines. Theor. Comput. Sci. 489-490: 88-98 (2013) - [c19]George Christodoulou, Martin Gairing:
Price of Stability in Polynomial Congestion Games. ICALP (2) 2013: 496-507 - [i5]George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang:
Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions. CoRR abs/1312.2371 (2013) - 2012
- [j6]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and approximation in potential games. Theor. Comput. Sci. 438: 13-27 (2012) - [c18]Vincenzo Auletta, George Christodoulou, Paolo Penna:
Mechanisms for Scheduling with Single-Bit Private Values. SAGT 2012: 25-36 - [i4]George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. CoRR abs/1202.2877 (2012) - 2011
- [j5]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. Algorithmica 61(1): 116-140 (2011) - [c17]George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. ESA 2011: 119-130 - [c16]George Christodoulou, Annamária Kovács:
A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks. WINE 2011: 84-96 - 2010
- [j4]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism design for fractional scheduling on unrelated machines. ACM Trans. Algorithms 6(2): 38:1-38:18 (2010) - [c15]George Christodoulou, Katrina Ligett, Evangelia Pyrga:
Contention Resolution under Selfishness. ICALP (2) 2010: 430-441 - [c14]George Christodoulou, Annamária Kovács:
A Deterministic Truthful PTAS for Scheduling Related Machines. SODA 2010: 1005-1016 - [c13]George Christodoulou, Khaled M. Elbassioni, Mahmoud Fouz:
Truthful Mechanisms for Exhibitions. WINE 2010: 170-181 - [c12]George Christodoulou, Annamária Kovács, Rob van Stee:
A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. WINE 2010: 182-193
2000 – 2009
- 2009
- [j3]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A Lower Bound for Scheduling Mechanisms. Algorithmica 55(4): 729-740 (2009) - [j2]George Christodoulou, Elias Koutsoupias:
Mechanism Design for Scheduling. Bull. EATCS 97: 40-59 (2009) - [j1]George Christodoulou, Elias Koutsoupias, Akash Nanavati:
Coordination mechanisms. Theor. Comput. Sci. 410(36): 3327-3336 (2009) - [c11]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games. ESA 2009: 251-262 - [c10]George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee:
On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97 - [i3]George Christodoulou, Annamária Kovács:
A deterministic truthful PTAS for scheduling related machines. CoRR abs/0907.3068 (2009) - 2008
- [c9]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A Characterization of 2-Player Mechanisms for Scheduling. ESA 2008: 297-307 - [c8]George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. ICALP (1) 2008: 820-832 - [r1]George Christodoulou:
Price of Anarchy. Encyclopedia of Algorithms 2008 - [i2]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis:
On the performance of approximate equilibria in congestion games. CoRR abs/0804.3160 (2008) - [i1]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A characterization of 2-player mechanisms for scheduling. CoRR abs/0807.3427 (2008) - 2007
- [c7]George Christodoulou, Laurent Gourvès, Fanny Pascual:
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON 2007: 187-197 - [c6]George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism Design for Fractional Scheduling on Unrelated Machines. ICALP 2007: 40-52 - [c5]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A lower bound for scheduling mechanisms. SODA 2007: 1163-1170 - 2006
- [c4]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and Approximation in Potential Games. STACS 2006: 349-360 - 2005
- [c3]George Christodoulou, Elias Koutsoupias:
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. ESA 2005: 59-70 - [c2]George Christodoulou, Elias Koutsoupias:
The price of anarchy of finite congestion games. STOC 2005: 67-73 - 2004
- [c1]George Christodoulou, Elias Koutsoupias, Akash Nanavati:
Coordination Mechanisms. ICALP 2004: 345-357
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-13 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
