Time-consistent stopping under decreasing impatience (Q1691445): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1502.03998 / rank
 
Normal rank

Revision as of 20:56, 18 April 2024

scientific article
Language Label Description Also known as
English
Time-consistent stopping under decreasing impatience
scientific article

    Statements

    Time-consistent stopping under decreasing impatience (English)
    0 references
    0 references
    0 references
    16 January 2018
    0 references
    The paper is devoted to a dynamic theory for stopping problems in continuous time. Three main features are: first, the authors provide a precise definition of a sophisticated stopping policy (or equilibrium stopping policy) in continuous time. Specifically, they introduce the operator, which describes the game-theoretic reasoning of a sophisticated agent. Sophisticated policies are formulated as fixed points of this operator, which connects to the concept of subgame-perfect Nash equilibrium. Second, they introduce a new, iterative approach for finding equilibrium strategies. For any initial stopping policy \(\tau\), they apply the operator described above to \(\tau\) repetitively until it converges to an equilibrium stopping policy. Under appropriate conditions, this fixed-point iteration indeed converges, which is the main result of this paper. Third, when an agent starts to do game-theoretic reasoning and to look for equilibrium strategies, he is not satisfied with an arbitrary equilibrium. Instead, he works on improving her initial strategy to turn it into an equilibrium. Proposed iterative approach specifically represents this improving process.
    0 references
    time inconsistency
    0 references
    optimal stopping
    0 references
    hyperbolic discounting
    0 references
    decreasing impatience
    0 references
    subgame-perfect Nash equilibrium
    0 references
    iterative approach
    0 references

    Identifiers