Exploiting structure in computationally hard voting problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Universitätsverlag der TU Berlin
2016
|
| Schriftenreihe: | Foundations of Computing
6 |
| Schlagworte: | |
| Online-Zugang: | kostenfrei Inhaltsverzeichnis |
| Beschreibung: | xxi, 257 Seiten Diagramme |
| ISBN: | 9783798328259 3798328250 |
| DOI: | 10.14279/depositonce-5113 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV044942999 | ||
| 003 | DE-604 | ||
| 005 | 20190513 | ||
| 007 | t | ||
| 008 | 180514s2016 gw |||| m||| 00||| eng d | ||
| 015 | |a 16,N47 |2 dnb | ||
| 016 | 7 | |a 1119091098 |2 DE-101 | |
| 020 | |a 9783798328259 |c Broschur : EUR 13.00 (DE), EUR 13.40 (AT) |9 978-3-7983-2825-9 | ||
| 020 | |a 3798328250 |9 3-7983-2825-0 | ||
| 024 | 3 | |a 9783798328259 | |
| 035 | |a (OCoLC)1035828344 | ||
| 035 | |a (DE-599)DNB1119091098 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-83 |a DE-188 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Chen, Jiehua |d 1984- |e Verfasser |0 (DE-588)1048730662 |4 aut | |
| 245 | 1 | 0 | |a Exploiting structure in computationally hard voting problems |c Jiehua Chen |
| 264 | 1 | |a Berlin |b Universitätsverlag der TU Berlin |c 2016 | |
| 300 | |a xxi, 257 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations of Computing |v 6 | |
| 502 | |b Dissertation |c Technische Universität Berlin |d 2015 | ||
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 653 | |a Algorithmen | ||
| 653 | |a Wahlprobleme | ||
| 653 | |a algorithms | ||
| 653 | |a computational social choice | ||
| 653 | |a parameterized complexity analysis | ||
| 653 | |a parametrisierte Komplexitätsanalyse | ||
| 653 | |a structured and nearly structured preferences | ||
| 653 | |a strukturierte Präferenzlisten | ||
| 653 | |a voting problems | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 710 | 2 | |a Technische Universität Berlin |b Universitätsbibliothek |0 (DE-588)5053182-7 |4 pbl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o 10.14279/depositonce-5113 |z 978-3-7983-2826-6 |w (DE-604)BV044943074 |
| 830 | 0 | |a Foundations of Computing |v 6 |w (DE-604)BV042337479 |9 6 | |
| 856 | 4 | 1 | |u https://doi.org/10.14279/depositonce-5113 |x Resolving-System |z kostenfrei |3 Volltext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030335884&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030335884 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804178528332152832 |
|---|---|
| adam_text | 1. INTRODUCTION AND OVERVIEW 1
1.1. THESIS OVERVIEW
....................................................................................
4
1.2. PUBLISHED
PAPERS....................................................................................
6
2. PRELIMINARIES AND NOTATION 11
2.1. RELATIONS AND
ORDERS...............................................................................
11
2.2. G
RAPHS...................................................................................................
12
2.3. PREFERENCE
PROFILES.................................................................................
13
2.4. VOTING RULES AND THEIR PRO P ERTIE
S.......................................................... 14
2.5. COMPUTATIONAL
COMPLEXITY....................................................................
16
2.6. PARAMETERIZED COM
PLEXITY....................................................................
17
I. STRUCTURED AND NEARLY STRUCTURED PREFERENCES 23
3. SINGLE-CROSSING PREFERENCES 25
3.1. INTRODUCTION
.........................................................................................
25
3.2. R
ESULTS...................................................................................................
26
3.3. CHAPTER
OUTLINE......................................................................................
27
3.4. DEFINITIONS, NOTATIONS, AND E X A M P LE
S.................................................. 27
3.5. A CHARACTERIZATION THROUGH FORBIDDEN CONFIGURATIONS
..........................
31
3.6. THE SIZE OF FORBIDDEN CONFIGURATIONS
....................................................
34
3.7. RECOGNIZING THE SINGLE-CROSSING PROPERTY
............................................
35
3.8. CONCLUDING REM ARKS
..............................................................................
37
4. ONE-DIMENSIONAL EUCLIDEAN PREFERENCES 39
4.1. INTRODUCTION
.........................................................................................
39
4.2. R
ESULTS...................................................................................................
42
4.3. CHAPTER
OUTLINE......................................................................................
42
4.4. DEFINITIONS, NOTATIONS, AND E X A M P LE
S.................................................. 43
4.5. STATEMENT OF THE MAIN RE S U LTS
............................................................... 47
4.6. DEFINITION OF THE PRO
FILES.......................................................................
48
4.7. THE PROFILES ARE NOT 1-D E
UCLIDEAN....................................................... 50
4.8. DEFINITION OF THE 1-D EUCLIDEAN EMBEDDINGS
.......................................
52
4.9. A COLLECTION OF TECHNICAL RE SU
LTS............................................................. 56
4.10. CORRECTNESS OF THE 1-D EUCLIDEAN
EMBEDDINGS..................................... 59
4.11. OTHER PROFILES THAT ARE NOT 1 -D E
UCLIDEAN............................................. 67
4.12. CONCLUDING REM
ARKS...............................................................................
69
5. NEARLY STRUCTURED PREFERENCES 71
5.1. INTRODUCTION
.........................................................................................
71
5.2. R
ESULTS....................................................................................................
73
5.3. RELATED W O R K
.........................................................................................
74
5.4. CHAPTER
OUTLINE.......................................................................................
76
5.5. PRELIMINARIES AND BASIC NOTATIONS
.......................................................
77
5.6. VALUE-RESTRICTED PROPERTIES
....................................................................
82
5.7. SINGLE-PEAKED, SINGLE-CAVED, AND GROUP-SEPARABLE P RO P E RTIE S
..................
87
5.8. SINGLE-CROSSING PRO P ERTIES
....................................................................
92
5.9. CONCLUDING REM
ARKS..................................................................................100
II. C OM PUTATIONALLY HARD VOTING PROBLEMS 103
6. COMBINATORIAL VOTER CONTROL 105
6.1. INTRODUCTION
............................................................................................
105
6.2. CHAPTER OUTLINE
.................................................
109
6.3. DEFINITIONS, NOTATIONS, AND EX A M P LE
S..................................................... 110
6.4. CENTRAL PROBLEM AND RE SU
LTS.....................................................................113
6.5. CANONICAL PARAM
ETERIZATIONS..................................................................
116
6.6. PARAMETERIZATION BY THE MAXIMUM BUNDLE SIZE AND BY THE SWAP
DISTANCE 124
6.7. SINGLE-PEAKED AND SINGLE-CROSSING C A S E S
................................................141
6.8. CONCLUDING REM
ARKS..................................................................................149
7. SHIFT BRIBERY 151
7.1. INTRODUCTION
............................................................................................
151
7.2. R
ESULTS.......................................................................................................154
7.3. CHAPTER
OUTLINE..........................................................................................156
7.4. DEFINITIONS, NOTATIONS AND EXAM
PLES........................................................157
7.5. PARAMETERIZATIONS BY SOLUTION COST MEASURES
........................................163
7.6. PARAMETERIZATIONS BY THE PREFERENCE PROFILE M EASU
RES...........................175
7.7. CONCLUDING REM
ARKS..................................................................................182
8. PARLIAMENTARY VOTING RULES 185
8.1. INTRODUCTION
............................................................................................
186
8.2. R
ESULTS.......................................................................................................189
8.3. CHAPTER OUTLINE
.........................................................................................
190
8.4. SPECIFIC NOTATIONS AND D E FIN ITIO N
S.......................................................... 191
8.5. AGENDA CONTROL
.........................................................................................
194
8.6. M
ANIPULATION............................................................................................
199
8.7. POSSIBLE/NECESSARY W IN N E R
....................................................................
203
8.8. EMPIRICAL STUDY OF A
GENDA
C
ONTROL
AND C
OALITIONAL
M
ANIPULATION
222
8.9. CONCLUDING REM
ARKS.................................................................................
226
9. CONCLUSION 229
9.1. MAIN CO N
TRIBUTIONS.................................................................................
230
9.2. OUTLOOK AND OPEN QUESTIONS
....................................................................
232
A. PROBLEM COMPENDIUM 253
ACKNOWLEDGMENTS 258
|
| any_adam_object | 1 |
| author | Chen, Jiehua 1984- |
| author_GND | (DE-588)1048730662 |
| author_facet | Chen, Jiehua 1984- |
| author_role | aut |
| author_sort | Chen, Jiehua 1984- |
| author_variant | j c jc |
| building | Verbundindex |
| bvnumber | BV044942999 |
| classification_rvk | ST 134 |
| collection | ebook |
| ctrlnum | (OCoLC)1035828344 (DE-599)DNB1119091098 |
| discipline | Informatik |
| doi_str_mv | 10.14279/depositonce-5113 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02452nam a22005898cb4500</leader><controlfield tag="001">BV044942999</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190513 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">180514s2016 gw |||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">16,N47</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1119091098</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798328259</subfield><subfield code="c">Broschur : EUR 13.00 (DE), EUR 13.40 (AT)</subfield><subfield code="9">978-3-7983-2825-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3798328250</subfield><subfield code="9">3-7983-2825-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783798328259</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1035828344</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1119091098</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Jiehua</subfield><subfield code="d">1984-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1048730662</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exploiting structure in computationally hard voting problems</subfield><subfield code="c">Jiehua Chen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverlag der TU Berlin</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxi, 257 Seiten</subfield><subfield code="b">Diagramme</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of Computing</subfield><subfield code="v">6</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2015</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithmen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Wahlprobleme</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational social choice</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parameterized complexity analysis</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parametrisierte Komplexitätsanalyse</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">structured and nearly structured preferences</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">strukturierte Präferenzlisten</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">voting problems</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Technische Universität Berlin</subfield><subfield code="b">Universitätsbibliothek</subfield><subfield code="0">(DE-588)5053182-7</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">10.14279/depositonce-5113</subfield><subfield code="z">978-3-7983-2826-6</subfield><subfield code="w">(DE-604)BV044943074</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of Computing</subfield><subfield code="v">6</subfield><subfield code="w">(DE-604)BV042337479</subfield><subfield code="9">6</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.14279/depositonce-5113</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030335884&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030335884</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV044942999 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:05:24Z |
| institution | BVB |
| institution_GND | (DE-588)5053182-7 |
| isbn | 9783798328259 3798328250 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030335884 |
| oclc_num | 1035828344 |
| open_access_boolean | 1 |
| owner | DE-83 DE-188 |
| owner_facet | DE-83 DE-188 |
| physical | xxi, 257 Seiten Diagramme |
| psigel | ebook |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Universitätsverlag der TU Berlin |
| record_format | marc |
| series | Foundations of Computing |
| series2 | Foundations of Computing |
| spelling | Chen, Jiehua 1984- Verfasser (DE-588)1048730662 aut Exploiting structure in computationally hard voting problems Jiehua Chen Berlin Universitätsverlag der TU Berlin 2016 xxi, 257 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Foundations of Computing 6 Dissertation Technische Universität Berlin 2015 Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmen Wahlprobleme algorithms computational social choice parameterized complexity analysis parametrisierte Komplexitätsanalyse structured and nearly structured preferences strukturierte Präferenzlisten voting problems (DE-588)4113937-9 Hochschulschrift gnd-content Informatik (DE-588)4026894-9 s 1\p DE-604 Technische Universität Berlin Universitätsbibliothek (DE-588)5053182-7 pbl Erscheint auch als Online-Ausgabe 10.14279/depositonce-5113 978-3-7983-2826-6 (DE-604)BV044943074 Foundations of Computing 6 (DE-604)BV042337479 6 https://doi.org/10.14279/depositonce-5113 Resolving-System kostenfrei Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030335884&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Chen, Jiehua 1984- Exploiting structure in computationally hard voting problems Foundations of Computing Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4026894-9 (DE-588)4113937-9 |
| title | Exploiting structure in computationally hard voting problems |
| title_auth | Exploiting structure in computationally hard voting problems |
| title_exact_search | Exploiting structure in computationally hard voting problems |
| title_full | Exploiting structure in computationally hard voting problems Jiehua Chen |
| title_fullStr | Exploiting structure in computationally hard voting problems Jiehua Chen |
| title_full_unstemmed | Exploiting structure in computationally hard voting problems Jiehua Chen |
| title_short | Exploiting structure in computationally hard voting problems |
| title_sort | exploiting structure in computationally hard voting problems |
| topic | Informatik (DE-588)4026894-9 gnd |
| topic_facet | Informatik Hochschulschrift |
| url | https://doi.org/10.14279/depositonce-5113 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030335884&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042337479 |
| work_keys_str_mv | AT chenjiehua exploitingstructureincomputationallyhardvotingproblems AT technischeuniversitatberlinuniversitatsbibliothek exploitingstructureincomputationallyhardvotingproblems |