COLLECTIVE COIN FLIPPING, ROBUST VOTING SCHEMES AND MINIMA OF BANZHAF VALUES.

Michael Ben-Or*, Nathan Linial

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

95 Scopus citations

Abstract

The authors study voting schemes that are relatively immune to the presence of unfair players. In particular, they discuss how to perform collective coin flipping that is only slightly biased despite the presence of unfair players. Mathematically, this corresponds to problems concerning the minima of Banzhaf values in certain n-person games. These are measures of power studied in game theory. It is remarked that while dictatorial voting games are, of course, the most sensitive to the presence of unfair players, some voting schemes that are proposed here are significantly more robust than majority voting. Coin flipping is selected as a study case because of its simplicity and because collective coin flipping is widely used in randomized algorithms for distributed computations.

Original languageAmerican English
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages408-416
Number of pages9
ISBN (Print)0818606444, 9780818606441
DOIs
StatePublished - 1985

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Fingerprint

Dive into the research topics of 'COLLECTIVE COIN FLIPPING, ROBUST VOTING SCHEMES AND MINIMA OF BANZHAF VALUES.'. Together they form a unique fingerprint.

Cite this