A
This content will become publicly available on July 1, 2024
Equilibria of time‐inconsistent stopping for one‐dimensional diffusion processes
Abstract We consider three equilibrium concepts proposed in the literature for time‐inconsistent stopping problems, including mild equilibria (introduced in Huang and Nguyen‐Huu (2018)), weak equilibria (introduced in Christensen and Lindensjö (2018)), and strong equilibria (introduced in Bayraktar et al. (2021)). The discount function is assumed to be log subadditive and the underlying process is one‐dimensional diffusion. We first provide necessary and sufficient conditions for the characterization of weak equilibria. The smooth‐fit condition is obtained as a by‐product. Next, based on the characterization of weak equilibria, we show that an optimal mild equilibrium is also weak. Then we provide conditions under which a weak equilibrium is strong. We further show that an optimal mild equilibrium is also strong under a certain condition. Finally, we provide several examples including one showing a weak equilibrium may not be strong, and another one showing a strong equilibrium may not be optimal mild.
more »
« less
- Award ID(s):
- 2106556
- NSF-PAR ID:
- 10444692
- Date Published:
- Journal Name:
- Mathematical Finance
- Volume:
- 33
- Issue:
- 3
- ISSN:
- 0960-1627
- Page Range / eLocation ID:
- 797 to 841
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract new notion of equilibrium, which we callstrong equilibrium , is introduced for time‐inconsistent stopping problems in continuous time. Compared to the existing notions introduced in Huang, Y.‐J., & Nguyen‐Huu, A. (2018, Jan 01). Time‐consistent stopping under decreasing impatience.Finance and Stochastics , 22(1), 69–95 and Christensen, S., & Lindensjö, K. (2018). On finding equilibrium stopping times for time‐inconsistent markovian problems.SIAM Journal on Control and Optimization , 56(6), 4228–4255, which in this paper are calledmild equilibrium andweak equilibrium , respectively, a strong equilibrium captures the idea of subgame perfect Nash equilibrium more accurately. When the state process is a continuous‐time Markov chain and the discount function is log subadditive, we show that an optimal mild equilibrium is always a strong equilibrium. Moreover, we provide a new iteration method that can directly construct an optimal mild equilibrium and thus also prove its existence. -
null (Ed.)A new definition of continuous-time equilibrium controls is introduced. As opposed to the standard definition, which involves a derivative-type operation, the new definition parallels how a discrete-time equilibrium is defined and allows for unambiguous economic interpretation. The terms “strong equilibria” and “weak equilibria” are coined for controls under the new and standard definitions, respectively. When the state process is a time-homogeneous continuous-time Markov chain, a careful asymptotic analysis gives complete characterizations of weak and strong equilibria. Thanks to the Kakutani–Fan fixed-point theorem, the general existence of weak and strong equilibria is also established under an additional compactness assumption. Our theoretic results are applied to a two-state model under nonexponential discounting. In particular, we demonstrate explicitly that there can be incentive to deviate from a weak equilibrium, which justifies the need for strong equilibria. Our analysis also provides new results for the existence and characterization of discrete-time equilibria under infinite horizon.more » « less
-
Guruswami, Venkatesan (Ed.)A fundamental shortcoming of the concept of Nash equilibrium is its computational intractability: approximating Nash equilibria in normal-form games is PPAD-hard. In this paper, inspired by the ideas of smoothed analysis, we introduce a relaxed variant of Nash equilibrium called σ-smooth Nash equilibrium, for a {smoothness parameter} σ. In a σ-smooth Nash equilibrium, players only need to achieve utility at least as high as their best deviation to a σ-smooth strategy, which is a distribution that does not put too much mass (as parametrized by σ) on any fixed action. We distinguish two variants of σ-smooth Nash equilibria: strong σ-smooth Nash equilibria, in which players are required to play σ-smooth strategies under equilibrium play, and weak σ-smooth Nash equilibria, where there is no such requirement. We show that both weak and strong σ-smooth Nash equilibria have superior computational properties to Nash equilibria: when σ as well as an approximation parameter ϵ and the number of players are all constants, there is a {constant-time} randomized algorithm to find a weak ϵ-approximate σ-smooth Nash equilibrium in normal-form games. In the same parameter regime, there is a polynomial-time deterministic algorithm to find a strong ϵ-approximate σ-smooth Nash equilibrium in a normal-form game. These results stand in contrast to the optimal algorithm for computing ϵ-approximate Nash equilibria, which cannot run in faster than quasipolynomial-time, subject to complexity-theoretic assumptions. We complement our upper bounds by showing that when either σ or ϵ is an inverse polynomial, finding a weak ϵ-approximate σ-smooth Nash equilibria becomes computationally intractable. Our results are the first to propose a variant of Nash equilibrium which is computationally tractable, allows players to act independently, and which, as we discuss, is justified by an extensive line of work on individual choice behavior in the economics literature.more » « less
-
more » « less
Abstract For an infinite‐horizon continuous‐time optimal stopping problem under nonexponential discounting, we look for an
optimal equilibrium , which generates larger values than any other equilibrium does on theentire state space. When the discount function is log subadditive and the state process is one‐dimensional, an optimal equilibrium is constructed in a specific form, under appropriate regularity and integrability conditions. Although there may exist other optimal equilibria, we show that they can differ from the constructed one in very limited ways. This leads to a sufficient condition for the uniqueness of optimal equilibria, up to some closedness condition. To illustrate our theoretic results, a comprehensive analysis is carried out for three specific stopping problems, concerning asset liquidation and real options valuation. For each one of them, an optimal equilibrium is characterized through an explicit formula. -
We initiate the study of equilibrium refinements based on trembling-hand perfection in extensive-form games with commitment strategies, that is, where one player commits to a strategy first. We show that the standard strong (and weak) Stackelberg equilibria are not suitable for trembling-hand perfection, because the limit of a sequence of such strong (weak) Stackelberg commitment strategies of a perturbed game may not be a strong (weak) Stackelberg equilibrium itself. However, we show that the universal set of all Stackelberg equilibria (i.e., those that are optimal for at least some follower response function) is natural for trembling- hand perfection: it does not suffer from the problem above. We also prove that determining the existence of a Stackelberg equilibrium--refined or not--that gives the leader expected value at least v is NP-hard. This significantly extends prior complexity results that were specific to strong Stackelberg equilibrium.more » « less
