22 citations · 55 across the 17 of their papers we have counts for
28 papers
The -server conjecture is true
Christian Coester, Elias Koutsoupias, Marek Zbysiński
The -server conjecture states that a deterministic online algorithm can achieve competitive ratio on every metric space. We prove the conjecture. Specifically, we show that…
One-dimensional vs. Multi-dimensional Pricing in Blockchain Protocols
Aggelos Kiayias, Elias Koutsoupias, Giorgos Panagiotakos +1
Blockchain transactions consume diverse resources, foremost among them storage, but also computation, communication, and others. Efficiently charging for these resources is crucial…
Pool Formation in Oceanic Games: Shapley Value and Proportional Sharing
Aggelos Kiayias, Elias Koutsoupias, Evangelos Markakis +1
We study a game-theoretic model for pool formation in Proof of Stake blockchain protocols. In such systems, stakeholders can form pools as a means of obtaining regular rewards from…
Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies
Aggelos Kiayias, Elias Koutsoupias, Francisco Marmolejo-Cossio +1
Proof-of-stake blockchain protocols have emerged as a compelling paradigm for organizing distributed ledger systems. In proof-of-stake (PoS), a subset of stakeholders participate i…
Tiered Mechanisms for Blockchain Transaction Fees
Aggelos Kiayias, Elias Koutsoupias, Philip Lazos +1
Blockchain systems come with the promise of being inclusive for a variety of decentralized applications (DApps) that can serve different purposes and have different urgency require…
A proof of the Nisan-Ronen conjecture
George Christodoulou, Elias Koutsoupias, Annamaria Kovacs
Noam Nisan and Amir Ronen conjectured that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for unrelated machines is . This work…