Dicey Games characterize optimal strategies and complexity for teams using pairwise or limited shared randomness, proving they can exceed 1/4 win probability in a 4-player matching-pennies game against an adversary.
Algorand: Scaling byzantine agreements for cryptocurrencies
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.
BlockRaFT distributes blockchain node workloads via RAFT leader election and stateful/stateless partitioning, plus a concurrent Merkle tree optimization, to improve scalability, availability, and performance over single-node designs.
citing papers explorer
-
Dicey Games: Shared Sources of Randomness in Distributed Systems
Dicey Games characterize optimal strategies and complexity for teams using pairwise or limited shared randomness, proving they can exceed 1/4 win probability in a 4-player matching-pennies game against an adversary.
-
A Composable Game-Theoretic Framework for Blockchains
Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.
-
BlockRaFT: A Distributed Framework for Fault-Tolerant and Scalable Blockchain Nodes
BlockRaFT distributes blockchain node workloads via RAFT leader election and stateful/stateless partitioning, plus a concurrent Merkle tree optimization, to improve scalability, availability, and performance over single-node designs.