REVIEW 1 cited by
Distributed Consensus Resilient to Both Crash Failures and Strategic Manipulations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this paper, we study distributed consensus in synchronous systems subject to both unexpected crash failures and strategic manipulations by rational agents in the system. We adapt the concept of collusion-resistant Nash equilibrium to model protocols that are resilient to both crash failures and strategic manipulations of a group of colluding agents. For a system with $n$ distributed agents, we design a deterministic protocol that tolerates 2 colluding agents and a randomized protocol that tolerates $n - 1$ colluding agents, and both tolerate any number of failures. We also show that if colluders are allowed an extra communication round after each synchronous round, there is no protocol that can tolerate even 2 colluding agents and 1 crash failure.
Forward citations
Cited by 1 Pith paper
-
Beyond Byzantine: An Organizational Consensus Algorithm for Self-Interested Agents Under Information Asymmetry
OCA's simulation shows large coordination savings, but its theoretical guarantees rest on an invalid Perron-Frobenius application and a self-confirming penalty threshold.
Discussion (0). Continue with ORCID to comment.