Skip to main content

Distances in Voting and Committee Election Rules for General Preference Types

  • Conference paper
  • First Online:
Book cover Algorithmic Decision Theory (ADT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10576))

Included in the following conference series:

  • 846 Accesses

Abstract

Distances have a major role in voting theory. They can determine the outcome of an election or ways to influence elections via manipulation or bribery. In the first part of this abstract, previotus results concerning distance-based committee election rules are summarized, while current research questions are introduced in the second part.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bartholdi, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227–241 (1989)

    Article  MathSciNet  Google Scholar 

  2. Baumeister, D., Böhnlein, T., Rey, L., Schaudt, O., Selker, A.: Minisum and minimax committee election rules for genral preference types. In: Proceedings of the 22nd European Conference on Artificial Intelligence, pp. 1656–1657. IOS press (2016)

    Google Scholar 

  3. Baumeister, D., Dennisen, S.: Voter dissatisfaction in committee elections. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 1707–1708. IFAAMAS (2015)

    Google Scholar 

  4. Baumeister, D., Dennisen, S., Rey, L.: Winner determination and manipulation in minisum and minimax committee elections. In: Walsh, T. (ed.) ADT 2015. LNCS, vol. 9346, pp. 469–485. Springer, Cham (2015). doi:10.1007/978-3-319-23114-3_28

    Chapter  Google Scholar 

  5. Brams, S., Kilgour, D., Sanver, R.: A minimax procedure for electing committees. Public Choice 132, 401–420 (2007)

    Article  Google Scholar 

  6. Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587–601 (1973)

    Article  MathSciNet  Google Scholar 

  7. Obraztsova, S., Elkind, E.: Optimal manipulation of voting rules. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, vol. 2, pp. 619–626. IFAAMAS (2012)

    Google Scholar 

  8. Obraztsova, S., Elkind, E., Polukarov, M., Rabinovich, Z.: Doodle poll games. In: Proceedings of the First IJCAI-Workshop on Algorithmic Game Theory (2015)

    Google Scholar 

  9. Satterthwaite, M.: Strategy-proofness and arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theor. 10(2), 187–217 (1975)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lisa Rey .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Rey, L. (2017). Distances in Voting and Committee Election Rules for General Preference Types. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67504-6_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67503-9

  • Online ISBN: 978-3-319-67504-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics