Computational aspects of strategic behaviour in elections with top-truncated ballots

@article{Menon2017ComputationalAO,
  title={Computational aspects of strategic behaviour in elections with top-truncated ballots},
  author={Vijay Menon and Kate Larson},
  journal={Autonomous Agents and Multi-Agent Systems},
  year={2017},
  volume={31},
  pages={1506-1547}
}
Understanding when and how computational complexity can be used to protect elections against different manipulative actions has been a highly active research area over the past two decades. Much of this literature, however, makes the assumption that the voters or agents specify a complete preference ordering over the set of candidates. There are many multiagent systems applications, and even real-world elections, where this assumption is not warranted, and this in turn raises a series of… CONTINUE READING

Citations

Publications citing this paper.

References

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

Uncertainty in Preference Elicitation and Aggregation

  • AAAI
  • 2007
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

A reasonable social welfare function

AH Copeland
  • Seminar on applications of mathematics to social sciences,
  • 1951
VIEW 20 EXCERPTS
HIGHLY INFLUENTIAL

Choosing the level of a public good when agents have an outside option

  • Social Choice and Welfare
  • 2004
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL