On the influence of single participant in coin flipping schemes

Benny Chor and Mihály Geréb-Graus
Additional contact information
Benny Chor: Department of Computer Science
Mihály Geréb-Graus: Harvard University, Aiken Computation Laboratory

A chapter in Sequences, 1990, pp 138-143 from Springer

Abstract: 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).

Keywords: Infinite Sequence; Vote Scheme; Single Participant; Average Influence; Uniform Probability Distribution (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().