Byzantine preferential voting

DOI10.1007/978-3-030-04612-5_22zbMath1443.91134arXiv1803.02720OpenAlexW2793424722MaRDI QIDQ2190409

Darya Melnyk, Yuyi Wang, Roger Wattenhofer

Publication date: 18 June 2020

Full work available at URL: https://arxiv.org/abs/1803.02720

zbMATH Keywords

social choiceByzantine agreementmultivalueddistributed votingPareto-validity

Mathematics Subject Classification ID

Voting theory (91B12) Social choice (91B14)

Cites Work

• Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
• Multidimensional agreement in Byzantine systems
• Asynchronous byzantine agreement protocols
• Voting schemes for which it can be difficult to tell who won the election
• A lower bound for the time to assure interactive consistency
• The computational difficulty of manipulating an election
• Byzantine Agreement in Expected Polynomial Time
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Byzantine vector consensus in complete graphs
• Handbook of Computational Social Choice
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Multidimensional approximate agreement in Byzantine asynchronous systems
• A NEW MEASURE OF RANK CORRELATION
• A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
• Aggregating inconsistent information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item