Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Coin-flipping games immune against linear-sized coalitions (Extended abstract)
 

Summary: Coin-flipping games immune against linear-sized coalitions
(Extended 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
Abstract
Perfect information coin-flipping and leader-election
games arise naturally in the study of fault toler-
ant distributed computing and have been con-
sidered 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 uni-
versal constant times c. We show that a random
protocol of a certain length has this property and
give an explicit construction as well.
1 Introduction

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics