Contract enforcement and incentive compatibility in large economies with differential information: the role of exact feasibility

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.

On the Impossibility of an Exact Imperfect Monitoring Folk Theorem

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.

Exact arbitrage, well-diversified portfolios and asset pricing in large markets

: 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.

Algoritmos inteligentes para auto-correção, auto-verificação e auto-validação de medidas em sensores

This work presents a set of intelligent algorithms with the purpose of correcting calibration errors in sensors and reducting the periodicity of their calibrations. Such algorithms were designed using Artificial Neural Networks due to its great capacity of learning, adaptation and function approximation. Two approaches willbe shown, the firstone uses Multilayer Perceptron Networks to approximate the many shapes of the calibration curve of a sensor which discalibrates in different time points. This approach requires the knowledge of the sensor s functioning time, but this information is not always available. To overcome this need, another approach using Recurrent Neural Networks was proposed. The Recurrent Neural Networks have a great capacity of learning the dynamics of a system to which it was trained, so they can learn the dynamics of a sensor s discalibration. Knowingthe sensor s functioning time or its discalibration dynamics, it is possible to determine how much a sensor is discalibrated and correct its measured value, providing then, a more exact measurement. The algorithms proposed in this work can be implemented in a Foundation Fieldbus industrial network environment, which has a good capacity of device programming through its function blocks, making it possible to have them applied to the measurement process

Enumeração de espectro de distâncias de esquemas de modulação codificada em treliça empregando codificação turbo

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

Search schemes for random optimization algorithms that preserve the asymptotic distribution

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case.

Exact solution for a fermion in the background of a scalar inversely linear potential

The problem of a fermion subject to a general scalar potential in a two-dimensional world is mapped into a Sturm-Liouville problem for nonzero eigenenergies. The searching for possible bounded solutions is done in the circumstance of power-law potentials. The normalizable zero-eigenmode solutions are also searched. For the specific case of an inversely linear potential, which gives rise to an effective Kratzer potential, exact bounded solutions are found in closed form. The behaviour of the upper and lower components of the Dirac spinor is discussed in detail and some unusual results are revealed. (C) 2004 Elsevier B.V. All rights reserved.

Some exact solutions of the Dirac equation

Exact analytic solutions are found to the Dirac equation for a combination of Lorentz scalar and vector Coulombic potentials with additional non-Coulombic parts. An appropriate linear combination of Lorentz scalar and vector non-Coulombic potentials, with the scalar part dominating, can be chosen to give exact analytic Dirac wave functions.

Exact closed-form solutions of the Dirac equation for a class of effective Morse potentials

Exact bounded solutions for a fermion subject to exponential scalar potential in 1 + 1 dimensions are found in closed form. We discuss the existence of zero modes which are related to the ultrarelativistic limit of the Dirac equation and are responsible for the induction of a fractional fermion number on the vacuum.

Dirac equation exact solutions for generalized asymmetrical Hartmann potentials

In this work we solve the Dirac equation by constructing the exact bound state solutions for a mixing of vector and scalar generalized Hartmann potentials. This is done provided the vector potential is equal to or minus the scalar potential. The cases of some quasi-exactly solvable and Morse-like potentials are briefly commented. (c) 2006 Elsevier B.V. All rights reserved.