direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Workshop Schedule

Wednesday (October 8)
Time
Event

19:00-21:00

Arrival of guests and welcome reception


Thursday (October 9)
Time
Event

09:00-10:00
Big Picture Talk 1
Toby Walsh:
Allocation in Practice
10:00-10:30
Coffee Break

10:30-10:50
10:50-11:10
11:10-11:30
Contributed Talks 1
Agnes Cseh: Sequential matching methods
Tamás Fleiner: Pareto optimality in many-to-many matching problems
Zsuzsanna Jankó: Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms
11:30-12:00
Coffee Break

12:00-12:20
12:20-12:40
12:40-13:00
Contributed Talks 2
Martin Lackner: On Detecting Nearly Structured Preference Profiles
Marie-Louise Bruner: The Likelihood of Structure in Preference Profiles
Bart Smeulders: Recognizing Single-Peaked Preferences in Aggregated Choice Data
13:00-14:00
Lunch
14:00-15:30
Open Discussions

15:30-16:30


Big Picture Talk 2
Clemens Puppe:
Arrovian Aggregation on Restricted Preference Domains Revisited
16:30-17:00
Coffee Break

17:00-17:20
17:20-17:40
Contributed Talks 3
Joachim Schauer: On the Shortest Path Game
Svetlana Obraztsova: Everybody lies: game-theoretic models for approval voting
17:40-19:00
Open Discussions
19:00-20:00
Dinner
20:00-21:00
Rump Session
Friday (October 10)
Time
Event

09:00-10:00
Big Picture Talk 3
Ariel Procaccia:
Computational Fair Division: From Cake Cutting to Cloud Computing
10:00-10:30
Coffee Break

10:30-10:50
10:50-11:10
11:10-11:30
Contributed Talks 4
Robert Bredereck: Network-based vertex dissolution
Marco Chiarandini: Handling Preferences in Student Project Allocation
Andreas Darmann: Maximizing Nash Product Social Welfare in allocating indivisible goods

11:30-12:00
Coffee Break

12:00-12:20
12:20-12:40
12:40-13:00
Contributed Talks 5
Johannes Hofbauer: A Stronger Notion of Participation
Hans Georg Seedig: Computational Social Choice with Few Voters
Christian Geist: Gaining Insights in Social Choice via Computer-aided Methods
13:00-14:00
Lunch
14:00-15:30
Open Discussions

15:30-16:30


Big Picture Talk 4
Edith Elkind:
Justified Representation

16:30-17:00
Coffee Break

17:00-17:20
17:20-17:40
17:40-18:00
Contributed Talks 6
Hilmar Schadrack: Introduction to Online Participation
Andrea Loreggia: From sentiment analisys to preference aggregation
Ronald de Haan: Complexity of the Winner Determination Problem in Judgment Aggregation
18:00-19:00
Open Discussions
19:00-20:00
Dinner
Saturday (October 11)
Time
Event

09:00-10:00
Big Picture Talk 5
Arkadii Slinko:
Several algorithmic problems for multi winner election rules

10:00-10:30
Coffee Break

10:30-10:50
10:50-11:10
11:10-11:30
Contributed Talks 7
Christian Reger: Bribery under partial information
Dominikus Krüger: On the Hardness of Bribery Variants in Voting with CP-Nets
Andreas Pfandler: On the Parameterized Complexity of Generalized CP-Nets
11:30-12:00
Coffee Break

12:00-13:00


Big Picture Talk 6
Gerhard J. Woeginger:
Obstructions and forbidden substructures in Social Choice
13:00-14:00
Lunch

 

 

Zusatzinformationen / Extras