On the influence of single participant in coin flipping schemes

Benny Chor, Mihály Geréb-Graus

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

Abstract

We prove that in a one round fair coin flipping scheme with n participants, either the average influence of all participants is at least 3/n --- o(1/n), or there is at least one participant whose influence is $, (n-5/6).
Original languageUndefined/Unknown
Title of host publicationSequences
Subtitle of host publicationCombinatorics, Compression, Security, and Transmission
EditorsRenato M. Capocelli
Place of PublicationNew York, NY
PublisherSpringer New York
Pages138-143
Number of pages6
Edition1
ISBN (Electronic)978-1-4612-3352-7
ISBN (Print)978-0-387-97186-5, 978-1-4612-7977-8
DOIs
StatePublished - 1990
Externally publishedYes

Cite this