Abstract
It is proved that for every c < 1 there are perfect-information coin-flipping and leader-election games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c. It is shown that a random protocol of a certain length has this property, and an explicit construction is given as well.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 46-54 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Industry Applications |
| Volume | 27 |
| Issue number | 1 pt 1 |
| State | Published - Jan 1991 |
| Externally published | Yes |
| Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: Oct 1 1989 → Oct 5 1989 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Industrial and Manufacturing Engineering
- Electrical and Electronic Engineering