Elias Koutsoupias

According to our database1, Elias Koutsoupias authored at least 73 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Blockchain Mining Games with Pay Forward.
Proceedings of the World Wide Web Conference, 2019

The online k-taxi problem.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Wealth Inequality and the Price of Anarchy.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Better Bounds for Online Line Chasing.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Energy Equilibria in Proof-of-Work Mining.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Online Trading as a Secretary Problem.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
Online Market Intermediation.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Infinite Server Problem.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Blockchain Mining Games.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The FedEx Problem.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Anarchy of Scheduling Without Money.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Revenue Maximization for Market Intermediation with Correlated Priors.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Carpooling in Social Networks.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Selling Two Goods Optimally.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Duality and optimality of auctions for uniform distributions.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
Preface to Special Issue on Algorithmic Game Theory.
Theory Comput. Syst., 2013

A Lower Bound of 1+φ for Truthful Scheduling Mechanisms.
Algorithmica, 2013

Near-optimal multi-unit auctions with ordered bidders.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Prior-Free Auctions of Digital Goods.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Approaching utopia: strong truthfulness and externality-resistant mechanisms.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?
Algorithmica, 2012

Competitive Analysis of Maintaining Frequent Items of a Stream.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Beyond myopic best response (in Cournot competition).
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Contention Issues in Congestion Games.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Scheduling without Payments.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Recent Developments in the Mechanism Design Problem for Scheduling.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
On the Competitive Ratio of Online Sampling Auctions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

2009
Mechanism Design for Scheduling.
Bulletin of the EATCS, 2009

The k-server problem.
Computer Science Review, 2009

Competitive Analysis of Aggregate Max in Windowed Streaming.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

On the Performance of Approximate Equilibria in Congestion Games.
Proceedings of the Algorithms, 2009

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

2007
A lower bound for scheduling mechanisms.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A Lower Bound of 1+phi for Truthful Scheduling Mechanisms.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Selfish Load Balancing Under Partial Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Mechanism Design for Fractional Scheduling on Unrelated Machines.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2005
An economic model of the worldwide web.
Proceedings of the 14th international conference on World Wide Web, 2005

Experiments with an Economic Model of the Worldwide Web.
Proceedings of the Internet and Network Economics, First International Workshop, 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

2004
Coordination mechanisms for congestion games.
SIGACT News, 2004

Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Congestion Games and Coordination Mechanisms.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Coordination Mechanisms.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
More on randomized on-line algorithms for caching.
Theor. Comput. Sci., 2003

Selfish Task Allocation.
Bulletin of the EATCS, 2003

The Online Matching Problem on a Line.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002
On a model of indexability and its bounds for range queries.
J. ACM, 2002

Approximate Equilibria and Ball Fusion.
Proceedings of the SIROCCO 9, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000
Beyond Competitive Analysis.
SIAM J. Comput., 2000

The CNN Problem and Other k-Server Variants.
Proceedings of the STACS 2000, 2000

On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.
Proceedings of the STACS 2000, 2000

Optimization Problems in Congestion Control.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Three-Processor Tasks Are Undecidable.
SIAM J. Comput., 1999

Competitive Implementation of Parallel Programs.
Algorithmica, 1999

Worst-case Equilibria.
Proceedings of the STACS 99, 1999

Indexing Schemes for Random Points.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Weak Adversaries for the k-Server Problem.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Tight Bounds for 2-Dimensional Indexing Schemes.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

1997
On the Analysis of Indexing Schemes.
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

1996
The 2-Evader Problem.
Inf. Process. Lett., 1996

Searching a Fixed Graph.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
On the k-Server Conjecture.
J. ACM, 1995

3-Processor Tasks Are Undecidable (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

An Approximation Scheme for Planar Graph TSP.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Beyond Competitive Analysis
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Improvements on Khrapchenko's theorem.
Theor. Comput. Sci., 1993

Competitive Implementation of Parallel Programs.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
On the Greedy Algorithm for Satisfiability.
Inf. Process. Lett., 1992

On the Optimal Bisection of a Polygon.
INFORMS Journal on Computing, 1992

1990
On the Optimal Bisection of a Polygon (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990


  Loading...