Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)

d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Center, San Jose, CA 95120 Perfect information coin-flipping and leader-election games arise naturally in the study of fault tolerant distributed computing and have been considered in many different scenarios. Answering a question of Ben-Or and Linial we prove that for every c < 1 there are such games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c. We show that a random protocol of a certain length has this property and give an explicit construction as well.

• Type: Conference
• Year: 1990
• Where: FOCS
• Authors: Noga Alon, Moni Naor
• Keywords: FOCS 1990, IBM Almaden Research Center, San Jose, Tel Aviv, Theoretical Computer Science