Skip to main content

The Strategy of Campaigning

  • Chapter
  • First Online:
Fields of Logic and Computation II

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9300))

Abstract

We prove an abstract theorem which shows that under certain circumstances, a candidate running for political office should be as explicit as possible in order to improve her impression among the voters. But this result conflicts with the perceived reality that candidates are often cagey and reluctant to take stances except when absolutely necessary. Why this hesitation on the part of the candidates? We offer some explanations.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Notes

  1. 1.

    If the statements which she has already made constitute a set T, then Z is the set of those states \(\omega \) which satisfy T.

  2. 2.

    Note that we are not making assumptions like single peak preference. The model we use allows for a candidate who is a social conservative and an economic liberal (e.g. Carter), or a socially liberal candidate who is hawkish on foreign policy (Johnson).

  3. 3.

    We assume that the measure of the set of voters is normalized to be 1.

  4. 4.

    Note that the set V is fixed but Z depends on what the candidate has said so far and may say in the future. However, fights between Democrats and Republicans over “illegal voters” or “voter suppression” are over the precise makeup of the set V. A candidate may well seek to increase her average satisfaction by seeking to include in V some members who like her present positions or to exclude those who dislike these positions.

References

  1. Alesina, A.F., Cukierman, A.: ‘The politics of ambiguity. Q. J. Econ. 105(4), 829–850 (1987)

    Article  Google Scholar 

  2. Brams, S.: The Presidential Election Game. Yale University Press, New Haven (1978). Revised edn., 2008 (A K Peters)

    MATH  Google Scholar 

  3. Dean, W., Parikh, R.: The logic of campaigning. In: Banerjee, M., Seth, A. (eds.) Logic and Its Applications. LNCS, vol. 6521, pp. 38–49. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Shepsle, K.A.: The strategy of ambiguity: uncertainty and electoral competition. Am. Polit. Sci. Rev. 66(02), 555–568 (1972)

    Article  Google Scholar 

  5. Tomz, M., Van Houweling, R.P.: The electoral implications of candidate ambiguity. Am. Polit. Sci. Rev. 103(01), 83–98 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rohit Parikh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Parikh, R., Taşdemir, Ç. (2015). The Strategy of Campaigning. In: Beklemishev, L., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds) Fields of Logic and Computation II. Lecture Notes in Computer Science(), vol 9300. Springer, Cham. https://doi.org/10.1007/978-3-319-23534-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23534-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23533-2

  • Online ISBN: 978-3-319-23534-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics