The influence of large coalitions

DOI10.1007/BF01303199zbMATH Open0807.90148OpenAlexW2047541256MaRDI QIDQ684398FDOQ684398

Authors: Miklós Ajtai, Nathan Linial 

Publication date: 15 September 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01303199

Recommendations

• How the size of a coalition affects its chances to influence an election
• Too big to prevail: the paradox of power in coalition formation
• scientific article; zbMATH DE number 3912148
• The effects of excluding coalitions
• Information and size of coalitions
• Coalition formation and stability
• Coalition formation and history dependence
• scientific article; zbMATH DE number 1226100
• scientific article; zbMATH DE number 859902

zbMATH Keywords

baton passingcoin-flipping gamescollective decision games

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cooperative games (91A12) Decision theory for games (91A35)

Cites Work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Robust Noncryptographic Protocol for Collective Coin Flipping
• Coin-Flipping Games Immune against Linear-Sized Coalitions
• Title not available (Why is that?)

Cited In (17)

• A lower bound for adaptively-secure collective coin flipping protocols
• On the Influence of Single Participant in Coin Flipping Schemes
• The power of small coalitions in graphs
• Fast perfect-information leader-election protocols with linear immunity
• Title not available (Why is that?)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
• Coin-Flipping Games Immune against Linear-Sized Coalitions
• Efficient counting with optimal resilience
• Players' effects under limited independence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit two-source extractors and resilient functions
• Influence of a Set of Variables on a Boolean Function
• Biased random walks
• A lower bound for adaptively-secure collective coin-flipping protocols
• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Randomness extraction in \(\mathsf{AC}^0\) and with small locality

This page was built for publication: The influence of large coalitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684398)