A Smooth Transition from Powerlessness to Absolute Power

@article{Mossel2012AST,
  title={A Smooth Transition from Powerlessness to Absolute Power},
  author={Elchanan Mossel and Ariel D. Procaccia and Mikl{\'o}s Z. R{\'a}cz},
  journal={ArXiv},
  year={2012},
  volume={abs/1205.2074}
}
  • Elchanan Mossel, Ariel D. Procaccia, Miklós Z. Rácz
  • Published in J. Artif. Intell. Res. 2012
  • Computer Science, Mathematics
  • ArXiv
  • We study the phase transition of the coalitional manipulation problem for generalized scoring rules. Previously it has been shown that, under some conditions on the distribution of votes, if the number of manipulators is o (√n), where n is the number of voters, then the probability that a random profile is manipulable by the coalition goes to zero as the number of voters goes to infinity, whereas if the number of manipulators is ω(√n), then the probability that a random profile is manipulable… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 17 CITATIONS

    Optimal Social Decision Making

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Modal Ranking: A Uniquely Robust Voting Rule

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND

    Generalized scoring rules: a framework that reconciles Borda and Condorcet

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Strategic Voting

    • Reshef Meir
    • Computer Science
    • IEEE Intell. Informatics Bull.
    • 2017

    Barriers to Manipulation in Voting

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Quantitative Analysis of Strategic Voting in Anonymous Voting Systems

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES

    How Many Vote Operations Are Needed to Manipulate A Voting System?

    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL

    Where are the hard manipulation problems?

    • Toby Walsh
    • Mathematics, Computer Science
    • J. Artif. Intell. Res.
    • 2010
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Finite Local Consistency Characterizes Generalized Scoring Rules

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    A sufficient condition for voting rules to be frequently manipulable

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Generalized scoring rules and the frequency of coalitional manipulability

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL