Computer Science Guest speaker: Ross Berkowitz

Wednesday, May 1, 2019
4:00 PM - 5:00 PM (ET)
Event Type
Bhaskar, Siddharth
Computer Science Faculty

Talk by Ross Berkowitz

Title: How many voters do you need to bribe to win an election?

Abstract:  A candidate on the eve of an election decides they want to win the following day, but bribes are so expensive!  They ask themself “what’s the fewest bribes I need to make to win this election with 99% probability”?  We will use mathematics to solve their quandary by analyzing how sensitive Boolean functions are to small changes to their inputs.  We will discuss the classical theory of influences of Boolean functions, their application to social choice, and introduce a new model where voter’s preferences are influenced by those of their friends.

Get Directions
Event Date
Event Time