George Christodoulou
Management Science and Operations Research · 2005
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Management Science and Operations Research — 6 citations into it; #11,128 of 11,946 by trust here, #8,906 by citations
Whom George Christodoulou trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Tim Roughgarden
- Elliot Anshelevich
- H. Nader
- Baruch Awerbuch
- É. Tardos
- Artur Czumaj
- Dov Monderer
- Anirban Dasgupta
- Christos H. Papadimitriou
Who trusts George Christodoulou overall
Papers from George Christodoulou's perspective
Ordered by how strongly the researchers George Christodoulou trusts endorse each paper. Same corpus, a different order for every researcher.
- The Price of Routing Unsplittable Flow (Symposium on the Theory of Computing)
- Potential Games
- The price of stability for network design with fair cost allocation (45th Annual IEEE Symposium on Foundations of Computer Science)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Games Econ. Behav.)
- Tight bounds for worst-case equilibria (ACM-SIAM Symposium on Discrete Algorithms)
- I Computational Complexity
- The price of anarchy is independent of the network topology (Symposium on the Theory of Computing)
- Algorithms, games, and the internet (Symposium on the Theory of Computing)
- The complexity of pure Nash equilibria (Symposium on the Theory of Computing)
- Charging and rate control for elastic traffic
Their papers
- The price of anarchy of finite congestion games (2005) — 501 citations