World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
9425
World Ranking
12386
National Ranking
790

Overview

Elias Koutsoupias is affiliated with the University of Oxford in the United Kingdom and works primarily in the field of Computer Science. Their research covers various subfields including Computer Networks and Communications, Information Systems, Management Science and Operations Research, Computational Theory and Mathematics, and Artificial Intelligence.

The scientist's main topics of work comprise:

  • Auction Theory and Applications
  • Optimization and Search Problems
  • Blockchain Technology Applications and Security
  • Complexity and Algorithms in Graphs
  • Cryptography and Data Security
  • Peer-to-Peer Network Technologies
  • Caching and Content Delivery

Frequent co-authors with whom Elias Koutsoupias has collaborated include Aggelos Kiayias, Philip Lazos, Francisco J. Marmolejo-Cossío, George Christodoulou, and Annamária Kovács.

Publications by Koutsoupias appear in a range of venues, with the majority published at arXiv (Cornell University). Other notable venues include the Leibniz-Zentrum für Informatik (Schloss Dagstuhl), ACM Transactions on Economics and Computation, SIAM Journal on Computing, and Theoretical Computer Science.

Recent notable papers include:

  • "Tiered Mechanisms for Blockchain Transaction Fees," 2023, arXiv (Cornell University)
  • "On the Nisan-Ronen Conjecture for Submodular Valuations," 2025, SIAM Journal on Computing
  • "Truthful Allocation in Graphs and Hypergraphs," 2021, arXiv (Cornell University)
  • "Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle," 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Truthful Allocation in Graphs and Hypergraphs," 2025, ACM Transactions on Economics and Computation

Best Publications

  • Worst-case equilibria

    Elias Koutsoupias;Christos Papadimitriou

  • The price of anarchy of finite congestion games

    George Christodoulou;Elias Koutsoupias

  • Beyond Competitive Analysis

    Elias Koutsoupias;Christos H. Papadimitriou

  • On the k-server conjecture

    Elias Koutsoupias;Christos H. Papadimitriou

  • Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet

    Alex Fabrikant;Elias Koutsoupias;Christos H. Papadimitriou

  • The structure and complexity of Nash equilibria for a selfish routing game

    Dimitris Fotakis;Spyros Kontogiannis;Elias Koutsoupias;Marios Mavronicolas

  • Blockchain Mining Games

    Aggelos Kiayias;Elias Koutsoupias;Maria Kyropoulou;Yiannis Tselekounis

  • A Lower Bound for Scheduling Mechanisms

    George Christodoulou;Elias Koutsoupias;Angelina Vidali

  • Coordination mechanisms

    George Christodoulou;Elias Koutsoupias;Akash Nanavati

  • On the analysis of indexing schemes

    Joseph M. Hellerstein;Elias Koutsoupias;Christos H. Papadimitriou

  • On the price of anarchy and stability of correlated equilibria of linear congestion games

    George Christodoulou;Elias Koutsoupias

  • Approximate Equilibria and Ball Fusion

    Elias Koutsoupias;Marios Mavronicolas;Paul G. Spirakis

  • An approximation scheme for planar graph TSP

    M. Grigni;E. Koutsoupias;C. Papadimitriou

  • On the greedy algorithm for satisfiability

    Elias Koutsoupias;Christos H. Papadimitriou

  • Searching a Fixed Graph

    Elias Koutsoupias;Christos H. Papadimitriou;Mihalis Yannakakis

  • The k-server problem

    Elias Koutsoupias

  • Optimization problems in congestion control

    R. Karp;E. Koutsoupias;C. Papadimitriou;S. Shenker

  • On a model of indexability and its bounds for range queries

    Joseph M. Hellerstein;Elias Koutsoupias;Daniel P. Miranker;Christos H. Papadimitriou

  • A lower bound of 1 + ϕ for truthful scheduling mechanisms

    Elias Koutsoupias;Angelina Vidali

  • Duality and Optimality of Auctions for Uniform Distributions

    Yiannis Giannakopoulos;Elias Koutsoupias

  • Beyond competitive analysis [on-line algorithms]

    E. Koutsoupias;C.H. Papadimitriou

Frequent Co-Authors

Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Paul G. Spirakis
Paul G. Spirakis University of Liverpool
Amos Fiat
Amos Fiat Tel Aviv University
Anna R. Karlin
Anna R. Karlin University of Washington
Aggelos Kiayias
Aggelos Kiayias University of Edinburgh
Marek Chrobak
Marek Chrobak University of California, Riverside
Joseph M. Hellerstein
Joseph M. Hellerstein University of California, Berkeley
Yair Bartal
Yair Bartal Hebrew University of Jerusalem
Eli Gafni
Eli Gafni University of California, Los Angeles
Edith Elkind
Edith Elkind University of Oxford

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options can significantly enhance your journey in computer science. Many students seek flexible and affordable programs to fast-track their careers or continue their education. For those aiming for advanced knowledge without accumulating hefty debt, pursuing the cheapest doctorate degree programs can be a strategic choice.

If your goal is to move quickly from study to professional practice, some of the easiest edd programs offer accelerated formats to advance your qualifications in less time. Additionally, earning one of the best associate degrees online provides a fast-track entry into the tech workforce—perfect for those eager to start building real-world experience.

For students interested in the intersection of computer science and business, consider an online business degree with financial aid. These programs can expand your career opportunities while helping to manage costs.

Exploring these related online pathways can open doors to specialized roles, higher salaries, and greater career flexibility within and beyond computer science.

Best Scientists Citing Elias Koutsoupias

Trending Scientists