• DocumentCode
    2775679
  • Title

    Coin-flipping games immune against linear-sized coalitions

  • Author

    Alon, Noga ; Naor, Moni

  • Author_Institution
    IBM Almaden Res. Center, San Jose, CA, USA
  • fYear
    1990
  • fDate
    22-24 Oct 1990
  • Firstpage
    46
  • 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
  • Keywords
    distributed processing; fault tolerant computing; game theory; probability; protocols; coin flipping games; fault tolerant distributed computing; game players; leader-election games; linear-sized coalitions; outcome influencing; perfect information games; probability; random protocol; Broadcasting; Distributed computing; Fault tolerance; Nominations and elections; Protocols; Size control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
  • Conference_Location
    St. Louis, MO
  • Print_ISBN
    0-8186-2082-X
  • Type

    conf

  • DOI
    10.1109/FSCS.1990.89523
  • Filename
    89523
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2775679