Functions without influential coalitions
Jeff Kahn, Gil Kalai

TL;DR
This paper provides counterexamples to longstanding conjectures by showing functions with unexpectedly small influences from large coalitions, challenging previous assumptions in the field.
Contribution
It introduces specific functions that disprove earlier conjectures about influence measures in Boolean functions.
Findings
Counterexamples to two conjectures from the 1980s.
Functions with small influences from large coalitions.
Challenges previous beliefs about influence in Boolean functions.
Abstract
We give counterexamples to a conjecture of Benny Chor and another of the second author, both from the late 80s, by exhibiting functions for which the influences of large coalitions are unexpectedly small relative to the expectations of the functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Game Theory and Voting Systems · Limits and Structures in Graph Theory
