Elias Koutsoupias

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Fair allocation in graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

On the nisan-ronen conjecture.

[BibT_eX]

[DOI]

SIGecom Exch., July, 2022

Algorithmic Game Theory and Blockchains (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Blockchain Economics, 2022

2021

The Infinite Server Problem.

[BibT_eX]

[DOI]

Christian Coester

ACM Trans. Algorithms, 2021

Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle.

[BibT_eX]

[DOI]

Christian Coester

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Truthful Allocation in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Incentives Against Power Grabs or How to Engineer the Revolution in a Pooled Proof of Stake System.

[BibT_eX]

[DOI]

Aggelos Kiayias

Aikaterini-Panagiota Stouka

Proceedings of the IEEE International Conference on Decentralized Applications and Infrastructures, 2021

2020

Prior-free multi-unit auctions with ordered bidders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Nisan-Ronen conjecture for submodular valuations.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Fairness and Efficiency in DAG-Based Cryptocurrencies.

[BibT_eX]

[DOI]

Georgios Birmpas

Francisco J. Marmolejo Cossío

Proceedings of the Financial Cryptography and Data Security, 2020

Reward Sharing Schemes for Stake Pools.

[BibT_eX]

[DOI]

Lars Brünjes

Aggelos Kiayias

Aikaterini-Panagiota Stouka

Proceedings of the IEEE European Symposium on Security and Privacy, 2020

Beyond Competitive Analysis.

[BibT_eX]

[DOI]

Anna R. Karlin

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

The anarchy of scheduling without money.

[BibT_eX]

[DOI]

Maria Kyropoulou

Theor. Comput. Sci., 2019

Beyond myopic best response (in Cournot competition).

[BibT_eX]

[DOI]

Games Econ. Behav., 2019

Blockchain Mining Games with Pay Forward.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

The online k-taxi problem.

[BibT_eX]

[DOI]

Christian Coester

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Wealth Inequality and the Price of Anarchy.

[BibT_eX]

[DOI]

Kurtulus Gemici

Barnabé Monnot

Georgios Piliouras

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Better Bounds for Online Line Chasing.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Energy Equilibria in Proof-of-Work Mining.

[BibT_eX]

[DOI]

Amos Fiat

Anna R. Karlin

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Duality and Optimality of Auctions for Uniform Distributions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Selling two goods optimally.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Online Trading as a Secretary Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

Online Market Intermediation.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Blockchain Mining Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The FedEx Problem.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Revenue Maximization for Market Intermediation with Correlated Priors.

[BibT_eX]

[DOI]

Matthias Gerstgrasser

Paul W. Goldberg

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Carpooling in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Competitive analysis of maintaining frequent items of a stream.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

Scheduling Without Payments.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

2013

On the Competitive Ratio of Online Sampling Auctions.

[BibT_eX]

[DOI]

George Pierrakos

ACM Trans. Economics and Comput., 2013

Preface to Special Issue on Algorithmic Game Theory.

[BibT_eX]

[DOI]

Spyros C. Kontogiannis

Pavlos G. Spirakis

Theory Comput. Syst., 2013

A Lower Bound of 1+<i>φ</i> for Truthful Scheduling Mechanisms.

[BibT_eX]

[DOI]

Algorithmica, 2013

Near-optimal multi-unit auctions with ordered bidders.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Prior-Free Auctions of Digital Goods.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Approaching utopia: strong truthfulness and externality-resistant mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Near-Optimal Multi-Unit Auctions with Ordered Bidders

[BibT_eX]

[DOI]

Stefano Leonardi

Tim Roughgarden

CoRR, 2012

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

[BibT_eX]

[DOI]

Carlos Fisch Brito

Shailesh Vaya

Algorithmica, 2012

Contention Issues in Congestion Games.

[BibT_eX]

[DOI]

Katia Papakonstantinopoulou

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

On the Performance of Approximate Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Algorithmica, 2011

Recent Developments in the Mechanism Design Problem for Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Mechanism design for fractional scheduling on unrelated machines.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

2009

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

[BibT_eX]

[DOI]

Dimitris Fotakis

Spyros C. Kontogiannis

Marios Mavronicolas

Theor. Comput. Sci., 2009

Coordination mechanisms.

[BibT_eX]

[DOI]

Akash Nanavati

Theor. Comput. Sci., 2009

Mechanism Design for Scheduling.

[BibT_eX]

Bull. EATCS, 2009

Worst-case equilibria.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2009

The k-server problem.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2009

A Lower Bound for Scheduling Mechanisms.

[BibT_eX]

[DOI]

Algorithmica, 2009

Competitive Analysis of Aggregate Max in Windowed Streaming.

[BibT_eX]

[DOI]

Luca Becchetti

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

A Characterization of 2-Player Mechanisms for Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

A Lower Bound of 1+<i>phi</i> for Truthful Scheduling Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Selfish Load Balancing Under Partial Knowledge.

[BibT_eX]

[DOI]

Panagiota N. Panagopoulou

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2005

An economic model of the worldwide web.

[BibT_eX]

[DOI]

Georgios Kouroupas

Proceedings of the 14th international conference on World Wide Web, 2005

Experiments with an Economic Model of the Worldwide Web.

[BibT_eX]

[DOI]

Georgios Kouroupas

Proceedings of the Internet and Network Economics, First International Workshop, 2005

The price of anarchy of finite congestion games.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

The CNN problem and other k-server variants.

[BibT_eX]

[DOI]

David Scot Taylor

Theor. Comput. Sci., 2004

On the competitive ratio of the work function algorithm for the k-server problem.

[BibT_eX]

[DOI]

Yair Bartal

Theor. Comput. Sci., 2004

Coordination mechanisms for congestion games.

[BibT_eX]

[DOI]

Marek Chrobak

SIGACT News, 2004

Competitive analysis of organization networks or multicast acknowledgement: how much to wait?

[BibT_eX]

[DOI]

Carlos Brito

Shailesh Vaya

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Congestion Games and Coordination Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

More on randomized on-line algorithms for caching.

[BibT_eX]

[DOI]

Marek Chrobak

John Noga

Theor. Comput. Sci., 2003

Approximate Equilibria and Ball Fusion.

[BibT_eX]

[DOI]

Marios Mavronicolas

Theory Comput. Syst., 2003

Selfish Task Allocation.

[BibT_eX]

Bull. EATCS, 2003

The Online Matching Problem on a Line.

[BibT_eX]

[DOI]

Akash Nanavati

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002

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

[BibT_eX]

[DOI]

Joseph M. Hellerstein

Daniel P. Miranker

Vasilis Samoladas

J. ACM, 2002

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

[BibT_eX]

[DOI]

Alex Fabrikant

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000

Beyond Competitive Analysis.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Optimization Problems in Congestion Control.

[BibT_eX]

[DOI]

Richard M. Karp

Scott Shenker

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Three-Processor Tasks Are Undecidable.

[BibT_eX]

[DOI]

Eli Gafni

SIAM J. Comput., 1999

Competitive Implementation of Parallel Programs.

[BibT_eX]

[DOI]

Xiaotie Deng

Philip D. MacKenzie

Algorithmica, 1999

Indexing Schemes for Random Points.

[BibT_eX]

[DOI]

David Scot Taylor

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Weak Adversaries for the k-Server Problem.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Tight Bounds for 2-Dimensional Indexing Schemes.

[BibT_eX]

[DOI]

David Scot Taylor

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

1997

On the Analysis of Indexing Schemes.

[BibT_eX]

[DOI]

Joseph M. Hellerstein

Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

1996

The 2-Evader Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Searching a Fixed Graph.

[BibT_eX]

[DOI]

Mihalis Yannakakis

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

On the k-Server Conjecture.

[BibT_eX]

[DOI]

J. ACM, 1995

3-Processor Tasks Are Undecidable (Abstract).

[BibT_eX]

[DOI]

Eli Gafni

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

An Approximation Scheme for Planar Graph TSP.

[BibT_eX]

[DOI]

Michelangelo Grigni

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1993

Improvements on Khrapchenko's theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Competitive Implementation of Parallel Programs.

[BibT_eX]

[DOI]

Xiaotie Deng

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

On the Greedy Algorithm for Satisfiability.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

On the Optimal Bisection of a Polygon.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

1990

On the Optimal Bisection of a Polygon (Extended Abstract).

[BibT_eX]

[DOI]