A Longstaff and Schwartz approach to the early election problem (Q1929895)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Longstaff and Schwartz approach to the early election problem
scientific article

    Statements

    A Longstaff and Schwartz approach to the early election problem (English)
    0 references
    0 references
    0 references
    10 January 2013
    0 references
    Summary: In many democratic parliamentary systems, election timing is an important decision availed to governments according to sovereign political systems. Prudent governments can take advantage of this constitutional option in order to maximize their expected remaining life in power. The problem of establishing the optimal time to call an election based on observed poll data has been well studied with several solution methods and various degrees of modeling complexity. The derivation of the optimal exercise boundary holds strong similarities with the American option valuation problem from mathematical finance. A seminal technique refined by \textit{F. A. Longstaff} and \textit{E. S. Schwartz} [``Valuing American options by simulation: a simple least-squares approach,'' Rev. Fin. Stud. 14, No. 1, 113--147 (2001; \url{doi:10.1093/rfs/14.1.113})] provided a method to estimate the exercise boundary of the American options using a Monte Carlo method and a least squares objective. In this paper, we modify the basic technique to establish the optimal exercise boundary for calling a political election. Several innovative adaptations are required to make the method work with the additional complexity in the electoral problem. The transfer of Monte Carlo methods from finance to determine the optimal exercise of real-options appears to be a new approach.
    0 references
    election timing
    0 references
    American option valuation
    0 references
    optimal exercise boundary
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references