How to win elections

Abdallah Sobehy; Walid Ben-Ameur; Hossam Afifi; Amira Bradai

doi:10.1007/978-3-319-59288-6_20

How to win elections

Abdallah Sobehy
, Walid Ben-Ameur
, Hossam Afifi
, Amira Bradai

Université Paris-Saclay

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Chapitre › Revue par des pairs

Résumé

Consider an election with two competing candidates and a set of voters whose opinions change over time. We study the best strategies that can be used by each candidate to influence voters. We also evaluate the knowledge advantage when one of the candidates knows in advance the adversary’s strategy. We prove that an economy of up to 50% of the budget can be saved in such a scenario.

langue originale	Anglais
titre	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Editeur	Springer Verlag
Pages	221-230
Nombre de pages	10
Les DOIs	https://doi.org/10.1007/978-3-319-59288-6_20
état	Publié - 1 janv. 2017
Modification externe	Oui

Série de publications

Nom	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume	201
ISSN (imprimé)	1867-8211

Accès au document

10.1007/978-3-319-59288-6_20

Contient cette citation

Sobehy, A., Ben-Ameur, W., Afifi, H., & Bradai, A. (2017). How to win elections. Dans Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (p. 221-230). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol 201). Springer Verlag. https://doi.org/10.1007/978-3-319-59288-6_20

@inbook{30678c2d14ab484399905bf13d6267ec,

title = "How to win elections",

abstract = "Consider an election with two competing candidates and a set of voters whose opinions change over time. We study the best strategies that can be used by each candidate to influence voters. We also evaluate the knowledge advantage when one of the candidates knows in advance the adversary{\textquoteright}s strategy. We prove that an economy of up to 50\% of the budget can be saved in such a scenario.",

keywords = "Mixed integer programming, Opinion dynamics, Random graphs, Reputation systems, Social networks, Trust management",

author = "Abdallah Sobehy and Walid Ben-Ameur and Hossam Afifi and Amira Bradai",

note = "Publisher Copyright: {\textcopyright} 2017, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-319-59288-6\_20",

language = "English",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",

publisher = "Springer Verlag",

pages = "221--230",

booktitle = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",

}

Sobehy, A, Ben-Ameur, W , Afifi, H & Bradai, A 2017, How to win elections. Dans Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, VOL. 201, Springer Verlag, p. 221-230. https://doi.org/10.1007/978-3-319-59288-6_20

How to win elections. / Sobehy, Abdallah; Ben-Ameur, Walid ; Afifi, Hossam et al.
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Springer Verlag, 2017. p. 221-230 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol 201).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Chapitre › Revue par des pairs

TY - CHAP

T1 - How to win elections

AU - Sobehy, Abdallah

AU - Ben-Ameur, Walid

AU - Afifi, Hossam

AU - Bradai, Amira

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Consider an election with two competing candidates and a set of voters whose opinions change over time. We study the best strategies that can be used by each candidate to influence voters. We also evaluate the knowledge advantage when one of the candidates knows in advance the adversary’s strategy. We prove that an economy of up to 50% of the budget can be saved in such a scenario.

AB - Consider an election with two competing candidates and a set of voters whose opinions change over time. We study the best strategies that can be used by each candidate to influence voters. We also evaluate the knowledge advantage when one of the candidates knows in advance the adversary’s strategy. We prove that an economy of up to 50% of the budget can be saved in such a scenario.

KW - Mixed integer programming

KW - Opinion dynamics

KW - Random graphs

KW - Reputation systems

KW - Social networks

KW - Trust management

U2 - 10.1007/978-3-319-59288-6_20

DO - 10.1007/978-3-319-59288-6_20

M3 - Chapter

AN - SCOPUS:85022081921

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SP - 221

EP - 230

BT - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

PB - Springer Verlag

ER -

Sobehy A, Ben-Ameur W , Afifi H, Bradai A. How to win elections. Dans Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Springer Verlag. 2017. p. 221-230. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). doi: 10.1007/978-3-319-59288-6_20

How to win elections

Résumé

Série de publications

Accès au document

Empreinte digitale

Contient cette citation