Counting Briberies in Elections

Niclas Boehmer, second year PhD student at Berlin Institute of Technology, comes on today to discuss the computational complexity of bribery in elections through the paper “On the Robustness of Winners: Counting Briberies in Elections.”

**Links Mentioned:** https://www.akt.tu-berlin.de/menue/team/boehmer_niclas/

**Works Mentioned:** [“On the Robustness of Winners: Counting Briberies in Elections.”](https://arxiv.org/abs/2010.09678) by Niclas Boehmer, Robert Bredereck, Piotr Faliszewski. Rolf Niedermier

**Thanks to our sponsors:**

[**Springboard School of Data**](https://springboard.com/dataskeptic): Springboard is a comprehensive end-to-end online data career program. Create a portfolio of projects to spring your career into action. Learn more about how you can be one of twenty $500 scholarship recipients at [springboard.com/dataskeptic](https://springboard.com/dataskeptic). This opportunity is exclusive to Data Skeptic listeners. (Enroll with code: DATASK)

[**Nord VPN**](https://nordvpn.com/dataskeptic): Protect your home internet connection with unlimited bandwidth. Data Skeptic Listeners-- take advantage of their Black Friday offer: purchase a 2-year plan, get 4 additional months free. [nordvpn.com/dataskeptic](https://nordvpn.com/dataskeptic) (Use coupon code DATASKEPTIC)

Guest

Niclas Boehmer: Niclas Boehmer is a second-year Ph.D. student working in the Algorithmics and Computational Complexity research group at TU Berlin. His research focuses on the algorithmic analysis of questions related to collective decision-making problems such as voting and coalition formation. He received his MA in computer science from the University of Oxford and his BA in computer science from the RWTH Aachen University.