Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules

@inproceedings{Betzler2009TowardsAD,
  title={Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules},
  author={Nadja Betzler and Britta Dorn},
  booktitle={MFCS},
  year={2009}
}
To make a joint decision, agents (or voters) are often requir d to provide their preferences as linear orders. To determine a winn er, the given linear orders can be aggregated according to a voting protocol. How ever, in realistic settings, the voters may often only provide partial orders. This directly leads to the POSSIBLE WINNER problem that asks, given a set of partial votes, if a distinguished candidate can still become a winner. In this work , we consider the computational complexity of… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS
38 Citations
16 References
Similar Papers

Citations

Publications citing this paper.

61 Citations

0510'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Alg orithms for the coalitional manipulation

  • M. Zuckerman, A. D. Procaccia, J. S. Rosenschein
  • problem.Artificial Intelligence,
  • 2009

Complexity of unweighted coalitional manipulation under some common voting rules

  • A. D. Procaccia Zuckerman, J. S. Rosenschein
  • 2009

Faliszewski . Nonuniform bribery ( short paper )

  • D. Hermelin, F. A. Rosamond, S. Vialette
  • 2008

Dichotomy for voting systems

  • K. B. Venable
  • J . Comput . Syst . Sci .
  • 2007

Similar Papers

Loading similar papers…