898 resultados para EXACT S-MATRIX
Resumo:
We consider exchange economies with a continuum of agents and differential information about finitely many states of nature. It was proved in Einy, Moreno and Shitovitz (2001) that if we allow for free disposal in the market clearing (feasibility) constraints then an irreducible economy has a competitive (or Walrasian expectations) equilibrium, and moreover, the set of competitive equilibrium allocations coincides with the private core. However when feasibility is defined with free disposal, competitive equilibrium allocations may not be incentive compatible and contracts may not be enforceable (see e.g. Glycopantis, Muir and Yannelis (2002)). This is the main motivation for considering equilibrium solutions with exact feasibility. We first prove that the results in Einy et al. (2001) are still valid without free-disposal. Then we define an incentive compatibility property motivated by the issue of contracts’ execution and we prove that every Pareto optimal exact feasible allocation is incentive compatible, implying that contracts of a competitive or core allocations are enforceable.
Resumo:
It is shown that, for almost every two-player game with imperfect monitoring, the conclusions of the classical folk theorem are false. So, even though these games admit a well-known approximate folk theorem, an exact folk theorem may only be obtained for a measure zero set of games. A complete characterization of the efficient equilibria of almost every such game is also given, along with an inefficiency result on the imperfect monitoring prisoner s dilemma.
Resumo:
All the demonstrations known to this author of the existence of the Jordan Canonical Form are somewhat complex - usually invoking the use of new spaces, and what not. These demonstrations are usually too difficult for an average Mathematics student to understand how he or she can obtain the Jordan Canonical Form for any square matrix. The method here proposed not only demonstrates the existence of such forms but, additionally, shows how to find them in a step by step manner. I do not claim that the following demonstration is in any way “elegant” (by the standards of elegance in fashion nowadays among mathematicians) but merely simple (undergraduate students taking a fist course in Matrix Algebra would understand how it works).
Resumo:
: In a model of a nancial market with an atomless continuum of assets, we give a precise and rigorous meaning to the intuitive idea of a \well-diversi ed" portfolio and to a notion of \exact arbitrage". We show this notion to be necessary and su cient for an APT pricing formula to hold, to be strictly weaker than the more conventional notion of \asymptotic arbitrage", and to have novel implications for the continuity of the cost functional as well as for various versions of APT asset pricing. We further justify the idealized measure-theoretic setting in terms of a pricing formula based on \essential" risk, one of the three components of a tri-variate decomposition of an asset's rate of return, and based on a speci c index portfolio constructed from endogenously extracted factors and factor loadings. Our choice of factors is also shown to satisfy an optimality property that the rst m factors always provide the best approximation. We illustrate how the concepts and results translate to markets with a large but nite number of assets, and relate to previous work.
Resumo:
The heteroskedasticity-consistent covariance matrix estimator proposed by White (1980), also known as HC0, is commonly used in practical applications and is implemented into a number of statistical software. Cribari–Neto, Ferrari & Cordeiro (2000) have developed a bias-adjustment scheme that delivers bias-corrected White estimators. There are several variants of the original White estimator that also commonly used by practitioners. These include the HC1, HC2 and HC3 estimators, which have proven to have superior small-sample behavior relative to White’s estimator. This paper defines a general bias-correction mechamism that can be applied not only to White’s estimator, but to variants of this estimator as well, such as HC1, HC2 and HC3. Numerical evidence on the usefulness of the proposed corrections is also presented. Overall, the results favor the sequence of improved HC2 estimators.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Endochondral calcification involves the participation of matrix vesicles (MVs), but it remains unclear whether calcification ectopically induced by implants of demineralized bone matrix also proceeds via MVs. Ectopic bone formation was induced by implanting rat demineralized diaphyseal bone matrix into the dorsal subcutaneous tissue of Wistar rats and was examined histologically and biochemically. Budding of MVs from chondrocytes was observed to serve as nucleation sites for mineralization during induced ectopic osteogenesis, presenting a diameter with Gaussian distribution with a median of 306 ± 103 nm. While the role of tissue-nonspecific alkaline phosphatase (TNAP) during mineralization involves hydrolysis of inorganic pyrophosphate (PPi), it is unclear how the microenvironment of MV may affect the ability of TNAP to hydrolyze the variety of substrates present at sites of mineralization. We show that the implants contain high levels of TNAP capable of hydrolyzing p-nitrophenylphosphate (pNPP), ATP and PPi. The catalytic properties of glycosyl phosphatidylinositol-anchored, polidocanol-solubilized and phosphatidylinositol-specific phospholipase C-released TNAP were compared using pNPP, ATP and PPi as substrates. While the enzymatic efficiency (k cat/Km) remained comparable between polidocanol-solubilized and membrane-bound TNAP for all three substrates, the k cat/Km for the phosphatidylinositol-specific phospholipase C-solubilized enzyme increased approximately 108-, 56-, and 556-fold for pNPP, ATP and PPi, respectively, compared to the membrane-bound enzyme. Our data are consistent with the involvement of MVs during ectopic calcification and also suggest that the location of TNAP on the membrane of MVs may play a role in determining substrate selectivity in this micro-compartment.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is the use of union bound of error probability, because of its easy implementation and computational produce bounds that converge quickly. Since it is the union bound, it should use to expurge some elements of distance spectrum to obtain a tight bound. The main contribution of this work is that the listing proposal is carried out from the puncturing at the level of symbol rather than bit-level as in most works of literature. The main reason for using the symbol level puncturing lies in the fact that the enummerating function of the turbo scheme is obtained directly from complex sequences of signals through the trellis and not indirectly from the binary sequences that require further binary to complex mapping, as proposed by previous works. Thus, algorithms can be applied through matrix from the adjacency matrix, which is obtained by calculating the distances of the complex sequences of the trellis. This work also presents two matrix algorithms for state reduction and the evaluation of the transfer function of this. The results presented in comparisons of the bounds obtained using the proposed technique with some turbo codes of the literature corroborate the proposition of this paper that the expurgated bounds obtained are quite tight and matrix algorithms are easily implemented in any programming software language
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)