Skip to main content

A Geometric Look at Manipulation

  • Conference paper
  • 507 Accesses

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

Abstract

We take a fresh look at voting theory, in particular at the notion of manipulation, by employing the geometry of the Saari triangle. This yields a geometric proof of the Gibbard/Satterthwaite theorem, and new insight into what it means to manipulate the vote. Next, we propose two possible strengthenings of the notion of manipulability (or weakenings of the notion of non-manipulability), and analyze how these affect the impossibility proof for non-manipulable voting rules.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arrow, K.: Social Choice and Individual Values, 2nd edn. Wiley, New York (1951)

    MATH  Google Scholar 

  2. Dowding, K., van Hees, M.: In praise of manipulation. British Journal of Political Science 38, 1–15 (2008), http://dx.doi.org/10.1017/S000712340800001X

    Article  Google Scholar 

  3. Eckert, D., Klamler, C.: A geometric approach to paradoxes of majority voting: From Anscombe’s paradox to the discursive dilemma with Saari and Nurmi. Homo Oeconomicus 26(3/4), 471–488 (2009)

    Google Scholar 

  4. van Eijck, J.: On Social Choice Theory. In: Discourses on Social Software, pp. 71–85. Amsterdam University Press, Amsterdam (2009), www.cwi.nl/~jve/books/pdfs/justOSCT.pdf

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Muller, E., Satterhwaite, M.: The equivalence of strong positive association and strategy proofness. Journal of Economic Theory 14, 412–418 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  7. Perote-Peña, J., Piggins, A.: Geometry and impossibility. Economic Theory 20, 831–836 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Saari, D.: Arrow impossibility theorem. In: Encyclopaedia of Mathematics. Springer Online Reference Works. Springer, Heidelberg (2001), http://eom.springer.de/a/a110710.htm

    Google Scholar 

  9. Saari, D.G.: Basic Geometry of Voting. Springer, Heidelberg (1995)

    Book  MATH  Google Scholar 

  10. Satterthwaite, M.A.: Strategy-proofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10, 187–217 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  11. Taylor, A.D.: Social Choice and the Mathematics of Manipulation. Mathematical Association of America and Cambridge University Press (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Eijck, J. (2011). A Geometric Look at Manipulation. In: Leite, J., Torroni, P., Ågotnes, T., Boella, G., van der Torre, L. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2011. Lecture Notes in Computer Science(), vol 6814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22359-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22359-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22358-7

  • Online ISBN: 978-3-642-22359-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics