Loading...
Please wait, while we are loading the content...
Similar Documents
Algorithms and Experiments for (Nearly) Restricted Domains in Elections
| Content Provider | Semantic Scholar |
|---|---|
| Author | Przedmojski, Tomasz |
| Copyright Year | 2016 |
| Abstract | In this master thesis we implement algorithms for detection of single-peaked or single-crossing preference profiles, and construction of nearly single-peaked or single-crossing profiles by deleting candidates or voters from an election. We also contribute our own algorithm for SINGLE-PEAKED CANDIDATE DELETION which has better time-complexity than the established algorithm. We employ Algorithm Engineering method to guide the implementation process. We use the implemented algorithms to evaluate the real-world election data available from PrefLib. We find no single-peaked or single-crossing preference profiles in PrefLib and limited evidence for nearly restricted domains in two of the eight data sets available from PrefLib. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://fpt.akt.tu-berlin.de/publications/theses/MA-tomasz-przedmojski.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
