TU Wien Informatics

20 Years
Newsroom Contact
Subscribe
Newsletter News Feed Calendar Feed Social Media

Second Vienna-Graz Workshop on (Computational) Social Choice

  • 2024-02-08

The workshop will take place on February 8 and 9 at TU Wien.

Second Vienna-Graz Workshop on (Computational) Social Choice

ABOUT THE EVENT

Computational social choice is a rapidly growing field of research at the intersection of computer sciences, economics, and political science that studies how we can make collective decisions in a better and fairer way, from the distribution of household chores to national elections. The Series “Vienna-Graz Workshop on (Computational) Social Choice” aims to bring together researchers from Vienna, Graz and beyond that work on (Computational) Social Choice and related fields. After a first successful edition in Graz, we are proud to host this year’s edition at TU Wien.

PROGRAM

Thursday, February 8, 2024

  • 11:30 - 12:15 Julia Neidhardt (TU Wien): TBD

  • 12:15 - 13:00 Carolina Plescia (Uni Wien): “Do people want a ‘fairer’ electoral system? An experimental study in four countries” (joint work with André Blais and John Högström)

  • 13:00 - 14.30 Lunch Break

  • 14:30 - 15:15 Rudolf Vetschera (Uni Wien): “Two-person fair division with additive valuations” (joint work with D. Marc Kilgour)

  • 15:15 - 16:00 Christian Klamler (Uni Graz): “Adjusted Winner with Indivisible Items and Money” (joint work with D. Marc Kilgour and Steven J. Brams)

  • 16:00 - 16:30 Coffee Break

  • 16:30 - 17:15 Andreas Darmann (Uni Graz): “Minimizing Agents’ Dissatisfaction under Preference Graphs” (joint work with Nina Chiarelli, Clément Dallard, Stefan Lendl, Martin Milanič, Peter Muršič and Ulrich Pferschy)

  • 17:15 - 18:00 Oliviero Nardi (TU Wien): “Repeated Fair Allocation of Indivisible Items” (joint work with Ayumi Igarashi, Martin Lackner and Arianna Novaro)

Friday, February 9, 2024

  • 9:00 - 9:45 Philipp Peitler (Uni Wien): “Putting Context into Preference Aggregation” (joint work with Karl Schlag)

  • 9.45 - 10.30 Daniel Eckert (Uni Graz): “A Problem with the Many: Suszko’s Thesis and Arrow’s Theorem”

  • 10:30 - 11:00 Coffee Break

  • 11:00 - 11:45 Christian Hatschka (TU Wien): “Algorithms for Multi-Winner Elections with Structured Preferences” (joint work with Jiehua Chen and Sofia Simola)

  • 11.45- 12.30 Matthias Greger (TU München): “Dynamics for Aggregating Cardinal Preferences” (joint work with Florian Brandl, Felix Brandt, Dominik Peters, Christian Stricker, Erel Segal-Halevi, Warut Suksompong)

  • 12:30 - 14:00 Lunch Break

  • 14:00 - 14:45 Adrian Haret (LMU München): TBD

  • 14:45 - 15:30 Michael Bernreiter (TU Wien): Combining Voting and Abstract Argumentation to Understand Online Discussions (joint work with Jan Maly, Oliviero Nardi and Stefan Woltran)

Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.