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

Michael Ben-Or; Nathan Linial

doi:10.1109/sfcs.1985.15

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

Michael Ben-Or^*, Nathan Linial

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

99 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 language	English
Title of host publication	Annual Symposium on Foundations of Computer Science (Proceedings)
Publisher	IEEE
Pages	408-416
Number of pages	9
ISBN (Print)	0818606444, 9780818606441
DOIs	https://doi.org/10.1109/sfcs.1985.15
State	Published - 1985

Publication series

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

Access to Document

10.1109/sfcs.1985.15

Cite this

@inproceedings{241a45175a6646008da6754fb269e075,

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

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.",

author = "Michael Ben-Or and Nathan Linial",

year = "1985",

doi = "10.1109/sfcs.1985.15",

language = "אנגלית",

isbn = "0818606444",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "IEEE",

pages = "408--416",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}

COLLECTIVE COIN FLIPPING, ROBUST VOTING SCHEMES AND MINIMA OF BANZHAF VALUES. / Ben-Or, Michael ; Linial, Nathan.
Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1985. p. 408-416 (Annual Symposium on Foundations of Computer Science (Proceedings)).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Ben-Or, Michael

AU - Linial, Nathan

PY - 1985

Y1 - 1985

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022181924&partnerID=8YFLogxK

U2 - 10.1109/sfcs.1985.15

DO - 10.1109/sfcs.1985.15

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0022181924

SN - 0818606444

SN - 9780818606441

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 408

EP - 416

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -

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

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this