Analysis of Boolean Functions at CMU - Lecture 3: Social choice and influences

Analysis of Boolean Functions at CMU - Lecture 3: Social choice and influences

🎙 Ryan O'Donnell 👥 14K 📅 July 7, 2017 ⏱ 77 min 👁 2K 📄 lecture 🧭 2026-08-17
Available in: English (current) Français

Keywords

Boolean functionssocial choiceinfluencevoting rulesmajoritydictatortribesweighted majorityimpartial cultureBanzhaf power index

Summary

This lecture, part of a graduate course on Analysis of Boolean Functions at Carnegie Mellon, introduces the application of Boolean functions to social choice theory. The instructor, Ryan O’Donnell, begins by framing Boolean functions as voting rules for elections with two candidates, where voters correspond to input bits. He presents several classic voting rules: majority, AND/OR, dictator, weighted majority (linear threshold), and the tribes function. He then defines desirable properties for voting rules, such as monotonicity, oddness (neutrality), symmetry (anonymity), unanimity, and unbiasedness, and analyzes which of the introduced functions satisfy these properties. The concept of influence is introduced as the probability that a voter’s vote is pivotal, leading to the Banzhaf power index. Examples are computed for AND, dictator, parity, and majority functions, illustrating the definition. The lecture sets the stage for proving Arrow’s theorem in the next session.

140 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides a clear and rigorous introduction to the intersection of Boolean functions and social choice theory. The value lies in its systematic approach: it defines a set of natural properties for voting rules and then evaluates several classic functions against them, building intuition for the mathematical analysis. The argumentation is solid, as each property is formally defined and examples are worked through in detail. The introduction of influence is well-motivated and its computation for various functions demonstrates the concept’s utility. The lecture effectively bridges abstract mathematical concepts with practical applications, making it valuable for both theoretical computer science and social choice audiences.

Scientific Rigor, Source Quality, Title Accuracy

The lecture is scientifically rigorous, with definitions and proofs presented in a formal manner. The instructor is a well-known expert in the field, and the content aligns with established literature on Boolean functions and social choice. The sources cited are primarily the course materials and the instructor’s own textbook, which are appropriate for a graduate-level lecture. The title accurately reflects the content, focusing on social choice and influences. The lecture does not rely on external sources but rather builds on foundational concepts, which is appropriate for a course lecture.

208 words

Title / Content Match

The title accurately reflects the content: the lecture focuses on social choice theory and the concept of influences in Boolean functions.

Quality & Reliability

9/10

Lecture by a recognized expert in theoretical computer science, part of a graduate course at Carnegie Mellon. The content is rigorous, well-structured, and based on established mathematical concepts. The video is a recording of a formal lecture, ensuring high reliability.

Key Moments

Cited Sources

Concurring Sources

  • Analysis of Boolean Functions (book) — The lecture follows the structure and content of this textbook.

Contribution & Novelties

This lecture provides a clear and systematic introduction to the application of Boolean functions to social choice theory, highlighting the concept of influence as a measure of voter power. It connects abstract mathematical concepts to practical voting scenarios, offering a foundation for further study in both fields.

Pour aller plus loin :

  • Arrow’s impossibility theorem — The lecture mentions proving Arrow’s theorem next time; this is a fundamental result in social choice.
  • Banzhaf power index — The influence measure is directly related to this index.
  • Analysis of Boolean Functions (book) — The free textbook by Ryan O’Donnell, which covers this material in depth.

103 words

Radar Profile

The radar profile shows high scores across all dimensions, indicating a well-rounded and reliable educational resource. The lecture excels in information quality and technical depth, with a strong foundation in formal mathematics.

Reliability 9/10