The Complexity of Bribery in Network-Based Rating Systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

The Complexity of Bribery in Network-Based Rating Systems

Résumé

We study the complexity of bribery in a network-based rating system, where individuals are connected in a social network and an attacker, typically a service provider, can influence their rating and increase the overall profit. We derive a number of algorithmic properties of this framework, in particular we show that establishing the existence of an optimal manipulation strategy for the attacker is NP-complete, even with full knowledge of the underlying network structure.
Fichier principal
Vignette du fichier
grandi_22667.pdf (209.01 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03621486 , version 1 (28-03-2022)

Identifiants

  • HAL Id : hal-03621486 , version 1
  • OATAO : 22667

Citer

Umberto Grandi, James Stewart, Paolo Turrini. The Complexity of Bribery in Network-Based Rating Systems. Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018), Feb 2018, New Orleans, United States. pp.1047-1054. ⟨hal-03621486⟩
9 Consultations
10 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More