Algorithmic aspects of manipulation and anonymization in social choice and social networks:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Hochschulschrift/Dissertation Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin
Universitätsverlag der TU Berlin
2016
|
| Schriftenreihe: | Foundations of computing
4 |
| Schlagwörter: | |
| Links: | https://doi.org/10.14279/depositonce-4941 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028984039&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | xiv, 275 Seiten Diagramme |
| ISBN: | 9783798328044 9783798328051 |
| DOI: | 10.14279/depositonce-4941 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV043569125 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 160524s2016 xx |||| m||| 00||| eng d | ||
| 020 | |a 9783798328044 |c Print |9 978-3-7983-2804-4 | ||
| 020 | |a 9783798328051 |c Online |9 978-3-7983-2805-1 | ||
| 035 | |a (OCoLC)957702970 | ||
| 035 | |a (DE-599)BVBBV043569125 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-473 |a DE-91 |a DE-12 | ||
| 100 | 1 | |a Talmon, Nimrod |e Verfasser |0 (DE-588)1101499222 |4 aut | |
| 245 | 1 | 0 | |a Algorithmic aspects of manipulation and anonymization in social choice and social networks |c Nimrod Talmon |
| 264 | 1 | |a Berlin |b Universitätsverlag der TU Berlin |c 2016 | |
| 300 | |a xiv, 275 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 4 | |
| 502 | |b Dissertation |c Technische Universität Berlin |d 2015 | ||
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Soziales Netzwerk |0 (DE-588)4055762-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kollektiventscheidung |0 (DE-588)4022393-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Anonymisierung |0 (DE-588)4139362-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Manipulation |0 (DE-588)4037348-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datensicherung |0 (DE-588)4011144-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Privatsphäre |0 (DE-588)4123980-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Kollektiventscheidung |0 (DE-588)4022393-0 |D s |
| 689 | 0 | 1 | |a Soziales Netzwerk |0 (DE-588)4055762-5 |D s |
| 689 | 0 | 2 | |a Manipulation |0 (DE-588)4037348-4 |D s |
| 689 | 0 | 3 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 4 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |D s |
| 689 | 0 | 5 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 0 | 6 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 7 | |a Anonymisierung |0 (DE-588)4139362-4 |D s |
| 689 | 0 | 8 | |a Privatsphäre |0 (DE-588)4123980-5 |D s |
| 689 | 0 | 9 | |a Datensicherung |0 (DE-588)4011144-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o 10.14279/depositonce-4941 |
| 830 | 0 | |a Foundations of computing |v 4 |w (DE-604)BV042337479 |9 4 | |
| 856 | 4 | 1 | |u https://doi.org/10.14279/depositonce-4941 |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=028984039&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-028984039 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0001 2016 A 4513 |
|---|---|
| DE-BY-TUM_katkey | 2232866 |
| DE-BY-TUM_location | Mag |
| DE-BY-TUM_media_number | 040007909099 |
| _version_ | 1821935470640103424 |
| adam_text |
CONTENTS
1. INTRODUCTION 1
1.1. GENTLE IN TROD U CTION
.
1
1.2. NOT-SO-GENTLE
INTRODUCTION.
8
2. PRELIMINARIES 13
2.1 GENERAL N O TA TIO N
S.
13
2.2. PARAMETERIZED C OM
PLEXITY.
14
2.3. GRAPHS AND SOCIAL N ETW ORK S
.
17
2.4. ELECTIONS AND C O N TRO
L.
19
2.5. SOME USEFUL COMPUTATIONAL P ROB LEM S
.
21
3. CANDIDATE CONTROL 25
3.1. ILLUSTRATING EXAMPLE
.
26
32
INTRODUCTION.
27
3.3. SPECIFIC P RELIM
INARIES.
33
3.4. MULTICOLORED CLIQUE PROOF TECHNIQUE
.
40
3.5. CUBIC VERTEX COVER PROOF TECH N IQ U E
.
53
3.6 SET-EMBEDDING PROOF TECHNIQUE FOR COMBINATORIAL VARIANTS. . . . 61
3 7 . SIGNATURE PROOF TECHNIQUE FOR DESTRUCTIVE CONTROL . 67
3.8.
OUTLOOK.
. 75
APPENDIX.
77
4. COMBINATORIAL SH!FT BRIBERY 103
4.1. ILLUSTRATING EXAMPLE
.
103
4.2.
INTRODUCTION.
105
43 SPECIFIC P RELIM
INARIES. 109
4.4 OVERVIEW OF OUR R E S U L T S
.
116
4.5. CONNECTION TO COMBINATORIAL C ONTROL
.
120
4.6. HARDNESS R ESU
LTS.
123
4.7 EXACT ALGORITHM
S.
135
4.8. APPROXIMATION A LGORITH M S
.
137
4.9.
OUTLOOK.
143
APPENDIX.
145
5. ANONYMIZING ELECTIONS 165
5.1. ILLUSTRATING EXAMPLE
.
166
5.2. INTRODUCTION
.
167
5.3. SPECIFIC P RELIM IN
ARIES.
170
S4. R E SU LTS
.
173
5.5.
OUTLOOK.
184
6. DEGREE ANONYMIZATION BY VERTEX ADD!T!
0
N 187
6.1. ILLUSTRATING EXAMPLE
.
187
6.2.
INTRODUCTION.
189
6.3. SPECIFIC P RELIM IN
ARIES.
194
6.4. CONSTRAINED DEGREE ANONYMIZATION
.
195
6.5. PLAIN DEGREE
ANONYMIZATION.
200
6.6.
OUTLOOK.
219
APPENDIX.
221
7. DEGREE ANONYMIZATION BY GRAPH CONTRACTIONS 229
7.1. ILLUSTRATING EXAMPLE
.
229
7.2.
INTRODUCTION.
231
7.3 SPECIFIC P RELIM IN
ARIES.
232
7.4 NP_HARDNESS R E S U LT S
.
238
7.5. GENERAL G
RAPHS.
244
7.6. BOUNDED-DEGREE G R A P H S
.
246
7.7
OUTLOOK.
253
8. OUTLOOK AND CONCLUSION 255
8.1
OUTLOOK.
255
8.2. CONCLUDING REM
ARKS.
259 |
| any_adam_object | 1 |
| author | Talmon, Nimrod |
| author_GND | (DE-588)1101499222 |
| author_facet | Talmon, Nimrod |
| author_role | aut |
| author_sort | Talmon, Nimrod |
| author_variant | n t nt |
| building | Verbundindex |
| bvnumber | BV043569125 |
| collection | ebook |
| ctrlnum | (OCoLC)957702970 (DE-599)BVBBV043569125 |
| doi_str_mv | 10.14279/depositonce-4941 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV043569125</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">160524s2016 xx |||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798328044</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-7983-2804-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798328051</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-7983-2805-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)957702970</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043569125</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="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Talmon, Nimrod</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1101499222</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic aspects of manipulation and anonymization in social choice and social networks</subfield><subfield code="c">Nimrod Talmon</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">xiv, 275 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">4</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Soziales Netzwerk</subfield><subfield code="0">(DE-588)4055762-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kollektiventscheidung</subfield><subfield code="0">(DE-588)4022393-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Anonymisierung</subfield><subfield code="0">(DE-588)4139362-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Manipulation</subfield><subfield code="0">(DE-588)4037348-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datensicherung</subfield><subfield code="0">(DE-588)4011144-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Privatsphäre</subfield><subfield code="0">(DE-588)4123980-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Kollektiventscheidung</subfield><subfield code="0">(DE-588)4022393-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Soziales Netzwerk</subfield><subfield code="0">(DE-588)4055762-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Manipulation</subfield><subfield code="0">(DE-588)4037348-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="6"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="7"><subfield code="a">Anonymisierung</subfield><subfield code="0">(DE-588)4139362-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="8"><subfield code="a">Privatsphäre</subfield><subfield code="0">(DE-588)4123980-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="9"><subfield code="a">Datensicherung</subfield><subfield code="0">(DE-588)4011144-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</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-4941</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">4</subfield><subfield code="w">(DE-604)BV042337479</subfield><subfield code="9">4</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.14279/depositonce-4941</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=028984039&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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028984039</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV043569125 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-11T13:42:14Z |
| institution | BVB |
| isbn | 9783798328044 9783798328051 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028984039 |
| oclc_num | 957702970 |
| open_access_boolean | 1 |
| owner | DE-83 DE-473 DE-BY-UBG DE-91 DE-BY-TUM DE-12 |
| owner_facet | DE-83 DE-473 DE-BY-UBG DE-91 DE-BY-TUM DE-12 |
| physical | xiv, 275 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 |
| spellingShingle | Talmon, Nimrod Algorithmic aspects of manipulation and anonymization in social choice and social networks Foundations of computing Approximationsalgorithmus (DE-588)4500954-5 gnd Soziales Netzwerk (DE-588)4055762-5 gnd Kollektiventscheidung (DE-588)4022393-0 gnd Anonymisierung (DE-588)4139362-4 gnd Manipulation (DE-588)4037348-4 gnd Datensicherung (DE-588)4011144-1 gnd NP-hartes Problem (DE-588)4621705-8 gnd Privatsphäre (DE-588)4123980-5 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4055762-5 (DE-588)4022393-0 (DE-588)4139362-4 (DE-588)4037348-4 (DE-588)4011144-1 (DE-588)4621705-8 (DE-588)4123980-5 (DE-588)4818897-9 (DE-588)4134751-1 (DE-588)4113937-9 |
| title | Algorithmic aspects of manipulation and anonymization in social choice and social networks |
| title_auth | Algorithmic aspects of manipulation and anonymization in social choice and social networks |
| title_exact_search | Algorithmic aspects of manipulation and anonymization in social choice and social networks |
| title_full | Algorithmic aspects of manipulation and anonymization in social choice and social networks Nimrod Talmon |
| title_fullStr | Algorithmic aspects of manipulation and anonymization in social choice and social networks Nimrod Talmon |
| title_full_unstemmed | Algorithmic aspects of manipulation and anonymization in social choice and social networks Nimrod Talmon |
| title_short | Algorithmic aspects of manipulation and anonymization in social choice and social networks |
| title_sort | algorithmic aspects of manipulation and anonymization in social choice and social networks |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Soziales Netzwerk (DE-588)4055762-5 gnd Kollektiventscheidung (DE-588)4022393-0 gnd Anonymisierung (DE-588)4139362-4 gnd Manipulation (DE-588)4037348-4 gnd Datensicherung (DE-588)4011144-1 gnd NP-hartes Problem (DE-588)4621705-8 gnd Privatsphäre (DE-588)4123980-5 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Approximationsalgorithmus Soziales Netzwerk Kollektiventscheidung Anonymisierung Manipulation Datensicherung NP-hartes Problem Privatsphäre Parametrisierte Komplexität Berechnungskomplexität Hochschulschrift |
| url | https://doi.org/10.14279/depositonce-4941 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028984039&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042337479 |
| work_keys_str_mv | AT talmonnimrod algorithmicaspectsofmanipulationandanonymizationinsocialchoiceandsocialnetworks |
Online lesen (frei zugänglich)
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Bibliotheksmagazin
| Signatur: |
0001 2016 A 4513 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |