Protocols forcing consensus

DOI10.1006/JETH.1996.0086MaRDI QIDQ1815206zbMATHOpenAlexFDO

Authors Paul Krasucki

Publication date 7 November 1996

Published in Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jeth.1996.0086

zbMATH Keywords

topology of the communication graph

Mathematics Subject Classification ID

Economics of information (91B44)

Recommendations

• Density-induced consensus protocol
• Consensus Propagation
• On consensus through communication without a commonly known protocol
• Consensus in Byzantine asynchronous systems
• Distributed consensus revisited
• Distributed consensus, revisited
• Consensus when all processes may be Byzantine for some time
• On the consensus protocol of conspecific agents

Cited in

(11)

• Models of latent consensus
• Convergence of the multidimensional agreement algorithm when communication fades away
• Common knowledge and consensus with noisy communication
• How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard
• Learning to agree over large state spaces
• Communication protocols with belief messages
• On the consensus protocol of conspecific agents
• A Petri net approach to consensus in networks with joint-agent interactions
• On consensus through communication without a commonly known protocol
• Geanakoplos and Sebenius model with noise.
• Consensus, communication and knowledge: an extension with Bayesian agents

This page was built for publication: Protocols forcing consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815206)