no code implementations • 21 Apr 2024 • Vincenzo Auletta, Diodato Ferraioli, Cosimo Vinci
We first show that whenever a certain single-round optimization problem can be optimally solved in polynomial time, then there is a polynomial time dynamic programming algorithm that returns the same solution as the optimal algorithm, that can adaptively choose both which observations to make and in which round to have them.
no code implementations • 14 Nov 2019 • Matteo Castiglioni, Nicola Gatti, Giulia Landriani, Diodato Ferraioli
We focus on the election manipulation problem through social influence, where a manipulator exploits a social network to make her most preferred candidate win an election.
no code implementations • 11 Feb 2019 • Matteo Castiglioni, Diodato Ferraioli, Giulia Landriani, Nicola Gatti
We study the problem of election control through social influence when the manipulator is allowed to use the locations that she acquired on the network for sending \emph{both} positive and negative messages on \emph{multiple} candidates, widely extending the previous results available in the literature that study the influence of a single message on a single candidate.
Computer Science and Game Theory
