Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency
In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made computationally difficult for the agents to perform. However, there are s...
Main Authors: | Umberto Grandi, Andrea Loreggia, Francesca Rossi, Kristen Brent Venable, Toby Walsh |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-03-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1303.0787v1 |
Similar Items
-
Strategy-proofness of the randomized Condorcet voting system
by: Hoang, Le Nguyen
Published: (2017) -
Voting and information aggregation. Theories and experiments in the tradition of condorcet
by: Rata, Cristina
Published: (2002) -
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
by: Maria Silvia Pini, et al.
Published: (2013-11-01) -
Condorcet voting theory based on analytical hierarchy process (AHP) for project selection problems
by: Mahad, N.F, et al.
Published: (2020) -
Condorcet Completion Methods that Inhibit Manipulation through Exploiting Knowledge of Electorate Preferences
by: Richard F. Potthoff
Published: (2014-10-01)