859 resultados para Conditional expected utility
Resumo:
The utility of canonical correlation analysis (CCA) for domain adaptation (DA) in the context of multi-view head pose estimation is examined in this work. We consider the three problems studied in 1], where different DA approaches are explored to transfer head pose-related knowledge from an extensively labeled source dataset to a sparsely labeled target set, whose attributes are vastly different from the source. CCA is found to benefit DA for all the three problems, and the use of a covariance profile-based diagonality score (DS) also improves classification performance with respect to a nearest neighbor (NN) classifier.
Resumo:
I contrast the theoretical foundation of profit maximization of Mas-Colell, Whinston and Green’s “Microeconomics” against that provided by Scitovsky in a paper of 1943. Whereas Mas-Colell, Whinston and Green try to show that profit maximization can be derived from utility maximization, Scitovsky categorically states the contrary view. I argue, first, that the foundation provided by Mas-Colell, Whinston and Green is not sound and, secondly, that Scitovsky’s line of reasoning opens a better way to model business behavior.
Resumo:
This paper proposes a GARCH-type model allowing for time-varying volatility, skewness and kurtosis. The model is estimated assuming a Gram-Charlier series expansion of the normal density function for the error term, which is easier to estimate than the non-central t distribution proposed by Harvey and Siddique (1999). Moreover, this approach accounts for time-varying skewness and kurtosis while the approach by Harvey and Siddique (1999) only accounts for nonnormal skewness. We apply this method to daily returns of a variety of stock indices and exchange rates. Our results indicate a significant presence of conditional skewness and kurtosis. It is also found that specifications allowing for time-varying skewness and kurtosis outperform specifications with constant third and fourth moments.
Resumo:
I consider cooperation situations where players have network relations. Networks evolve according to a stationary transition probability matrix and at each moment in time players receive payoffs from a stationary allocation rule. Players discount the future by a common factor. The pair formed by an allocation rule and a transition probability matrix is called expected fair if for every link in the network both participants gain, marginally, and in discounted, expected terms, the same from it; and it is called a pairwise network formation procedure if the probability that a link is created (or eliminated) is positive if the discounted, expected gains to its two participants are positive too. The main result is the existence, for the discount factor small enough, of an expected fair and pairwise network formation procedure where the allocation rule is component balanced, meaning it distributes the total value of any maximal connected subnetwork among its participants. This existence result holds for all discount factors when the pairwise network formation procedure is restricted. I finally provide some comparison with previous models of farsighted network formation.