2 resultados para maximal ontological completeness

em Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper investigates dynamic completeness of financial markets in which the underlying risk process is a multi-dimensional Brownian motion and the risky securities dividends geometric Brownian motions. A sufficient condition, that the instantaneous dispersion matrix of the relative dividends is non-degenerate, was established recently in the literature for single-commodity, pure-exchange economies with many heterogenous agents, under the assumption that the intermediate flows of all dividends, utilities, and endowments are analytic functions. For the current setting, a different mathematical argument in which analyticity is not needed shows that a slightly weaker condition suffices for general pricing kernels. That is, dynamic completeness obtains irrespectively of preferences, endowments, and other structural elements (such as whether or not the budget constraints include only pure exchange, whether or not the time horizon is finite with lump-sum dividends available on the terminal date, etc.)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper proposes a model of choice that does not assume completeness of the decision maker’s preferences. The model explains in a natural way, and within a unified framework of choice when preference-incomparable options are present, four behavioural phenomena: the attraction effect, choice deferral, the strengthening of the attraction effect when deferral is per-missible, and status quo bias. The key element in the proposed decision rule is that an individual chooses an alternative from a menu if it is worse than no other alternative in that menu and is also better than at least one. Utility-maximising behaviour is included as a special case when preferences are complete. The relevance of the partial dominance idea underlying the proposed choice procedure is illustrated with an intuitive generalisation of weakly dominated strategies and their iterated deletion in games with vector payoffs.