Understanding Social Choice Functions with Pairwise Preferences

30th April 2025 | 15:00 - 17:00 CEST | online

Summary

In this session, we delve into the foundational questions of collective decision-making through the lens of computation. We explore how algorithms and complexity theory intersect with voting systems, fair allocation, and coalition formation. The discussion will highlight key challenges such as manipulation resistance in elections, efficient division of goods, and stable group formation. This paper reading is ideal for anyone interested in the cross-disciplinary insights between computer science, economics, and political theory, and how they shape the design of fair and efficient collective choices.

Requirements

  • Join the AI Maker Community Slack Workspace: The communication during the session will happen through our Slack Workspace, in the #ai-maker-sessions channel: https://join.aimaker.community

  • Please register for this free event on Eventbrite.

Event Details

This is an online event. We will post a link to the session in Slack shortly before the session starts.

See also