IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2509.08249.html
   My bibliography  Save this paper

Electoral Competition with Credible Promises and Strategic Voters

Author

Listed:
  • Shiladitya Kumar

Abstract

How can voters induce politicians to put forth more proximate (in terms of preference) as well as credible platforms (in terms of promise fulfillment) under repeated elections? Building on the work of Aragones et al. (2007), I study how reputation and re-election concerns affect candidate behavior and its resultant effect on voters' beliefs and their consequent electoral decisions. I present a formal model where, instead of assuming voters to be naive, I tackle the question by completely characterizing a set of subgame-perfect equilibria by introducing non-naive (or strategic) voting behavior into the mix. I find that non-naive voting behavior, by using the candidate's reputation as an instrument of policy discipline after the election, aids in successfully inducing candidates to put forth their maximal incentive-compatible promise (among a range of such credible promises) in equilibrium. Through the credible threat of punishment in the form of loss of reputation for all future elections, non-naive voters gain a unanimous increase in expected utility relative to when they behave naively. In fact, comparative statics show that candidates who are more likely to win are more likely to keep their promises. In this framework, voters are not only able to bargain for more credible promises but also end up raising their expected future payoffs in equilibrium. Including such forms of strategic behavior thus reduces cheap talk by creating a credible electoral system where candidates do as they say once elected. Later, I present an analysis that includes limited punishment as a political accountability mechanism.

Suggested Citation

  • Shiladitya Kumar, 2025. "Electoral Competition with Credible Promises and Strategic Voters," Papers 2509.08249, arXiv.org.
  • Handle: RePEc:arx:papers:2509.08249
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2509.08249
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2509.08249. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.