TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 28.04.2016

isti-logo

Page Content

to Navigation

Algorithms and Experiments for (Nearly) Restricted Domains in Elections

Tomasz Przedmojski (TU Berlin)

 

In this presentation I will be covering my master thesis with the same title. I will be discussing algorithms for detection of single-peaked and single-crossing profiles and nearly single-peaked and nearly single-crossing profiles through candidate or through voter deletion. I will also cover my analysis of the election data available from PrefLib. Finally I will be exploring the algorithm I have developed for Single Peaked Candidate Deletion.

 

 

Date
Speaker
Location
Language
28.04.2016
16:15
Tomasz Przedmojski
TEL 512
english

Back to the research colloquium site.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe