Results 1  10
of
14
If You’re So Smart, Why Aren’t You Rich? Belief Selection in Complete and Incomplete Markets
, 2001
"... ..."
Asymmetric information in a competitive market game: Reexamining the implications of rational expectations
, 1997
"... We examine price formation in a simple static model with asymmetric information, an infinite number of risk neutral traders and no noise traders. Here we reexamine four results associated with rational expectations models relating to the existence of fully revealing equilibrium prices, the advant ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We examine price formation in a simple static model with asymmetric information, an infinite number of risk neutral traders and no noise traders. Here we reexamine four results associated with rational expectations models relating to the existence of fully revealing equilibrium prices, the advantage of becoming informed, the costly acquisition of information, and the impossibility of having equilibrium prices with higher volatility than the underlying fundamentals.
Market Analysis Using a Combination of Bayesian Networks and Description Logics
, 1999
"... The work described in this paper was inspired by a problem increasingly vexatious to many businesses confronting the everdiminishing life cycles of modern productsviz., that of predicting characteristics (such as overall demand, segmentation, etc.) of markets facing new product introductions. A ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The work described in this paper was inspired by a problem increasingly vexatious to many businesses confronting the everdiminishing life cycles of modern productsviz., that of predicting characteristics (such as overall demand, segmentation, etc.) of markets facing new product introductions. A framework is proposed that allows the market parameters of new products to be derived by analogy with those of old ones. To do so, the framework combines the capabilities of Bayesian networks [14] and description logics [16]. The paper commences with an exposition of the problem that motivates the work. There follow brief descriptions of Bayesian networks and description logics in their unalloyed state, and a discussion of issues surrounding their combination. The combined system is presented, along with an account of its formal details and an inference procedure for entailment. A sample application of the framework is given. The paper concludes by comparing the proposed framework with related existing systems and by suggesting possible courses for future development.
Possibilistic and Probabilistic AbstractionBased Model Checking
 Process Algebra and Probabilistic Methods, Performance Modeling and Veri Second Joint International Workshop PAPMPROBMIV 2002, volume 2399 of Lecture Notes in Computer Science
, 2002
"... models whose verification results transfer to the abstracted models for a logic with unrestricted use of negation and quantification. This framework is novel in that its models have quantitative or probabilistic observables and state transitions. Properties of a quantitative temporal logic have meas ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
models whose verification results transfer to the abstracted models for a logic with unrestricted use of negation and quantification. This framework is novel in that its models have quantitative or probabilistic observables and state transitions. Properties of a quantitative temporal logic have measurable denotations in these models. For probabilistic models such denotations approximate the probabilistic semantics of full LTL. We show how predicatebased abstractions specify abstract quantitative and probabilistic models with finite state space. 1
Solutions to Dilation Equations
, 2001
"... ion which arises when the Fourier transform is applied to a dilation equation. Applying this result to the Haar dilation equation allows us first to catalogue the L (R) solutions of this equation and then to produce some nice operator results regarding shift and dilation operators. We then consid ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ion which arises when the Fourier transform is applied to a dilation equation. Applying this result to the Haar dilation equation allows us first to catalogue the L (R) solutions of this equation and then to produce some nice operator results regarding shift and dilation operators. We then consider the same problem in R where, unfortunately, techniques using dilation equations are not as easy to apply. However, the operator results are retrieved using traditional multiplier techniques. In Chapter 3 we attempt to do some handson calculations using the results of Chapter 2. We discover a simple `factorisation' of the solutions of the Haar dilation equation. Using this factorisation we produce many solutions of the Haar dilation equation. We then examine how all these results might be applied to the solutions of other dilation equations. A technique which I have not seen exploited elsewhere is developed in Chapter 4. This technique examines a lefthand or righthand `end' of a dil
Multiresolution Aspects of Linear Approximation Methods in Hilbert Spaces Using Gridded Data
, 2000
"... This thesis presents a novel optimal methodology for dealing with linear estimation problems in spatial deterministic fields, using discrete and regularly gridded data. More specifically, a unified study of various important issues that affect the theoretical analysis and practical computations asso ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This thesis presents a novel optimal methodology for dealing with linear estimation problems in spatial deterministic fields, using discrete and regularly gridded data. More specifically, a unified study of various important issues that affect the theoretical analysis and practical computations associated with signal approximation problems (namely, stability, convergence, error analysis and choice of estimation model restrictions) is performed with respect to the data resolution parameter. A combination of different mathematical tools is employed for our theoretical developments, with the underlying ideas originating from the areas of deterministic collocation in Hilbert spaces, frame signal expansions, spatiostatistical collocation and multiresolution signal analysis theory. The spatiostatistical collocation principle is used to develop a new generalized multiresolution signal analysis scheme, which offers increased flexibility (in terms of scale level restrictions) and it is more powerful (in terms of approximation performance) than the classic dyadic multiresolution analyses that are associated with standard wavelet theory. Additional investigations are conducted on interpolation error analysis with respect to the data resolution level and the used estimation kernel, as well as on aliasing error propagation in convolution integral formulas using discrete gridded input data. Most of the theoretical developments are made with practical applications in mind, which means that an extensive (and original) treatment of the optimal noise filtering problem is also included, considering the most general case with nonstationary additive noise in the gridded input data.
On Randomized Algebraic Test Complexity
, 1992
"... We investigate the impact of randomization on the complexity of deciding membership in a (semi)algebraic subset X ae R m . Examples are exhibited where allowing for a certain error probability ffl in the answer of the algorithms the complexity of decision problems decreases. A randomized(\Omega ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the impact of randomization on the complexity of deciding membership in a (semi)algebraic subset X ae R m . Examples are exhibited where allowing for a certain error probability ffl in the answer of the algorithms the complexity of decision problems decreases. A randomized(\Omega k ; f=; g) decision tree (k ` R a subfield) over m will be defined as a pair (T ; ¯) where ¯ a probability measure on some R n and T is a(\Omega k ; f=; g)decision tree over m+n. We prove a general lower bound on the average decision complexity for testing membership in an irreducible algebraic subset X ae R m and apply it to kgeneric complete intersection of polynomials of the same degree, extending results in [4, 6]. We also give applications to nongeneric cases, such as graphs of elementary symmetric functions, SL(m; R), and determinant varieties, extending results in [Li 90]. 1 Dept. of Computer Science, University of Bonn, 5300 Bonn 1. Sponsored by the Schweizerischer Nat...
Private Bag 4800,
, 2006
"... In the following, I introduce the Lebesgue integral on the real line R using the method of F. Riesz. Working with increasing sequences of step functions whose integrals are uniformly bounded above, this method, which is essentially a special case of the Daniell approach to abstract integration, avoi ..."
Abstract
 Add to MetaCart
In the following, I introduce the Lebesgue integral on the real line R using the method of F. Riesz. Working with increasing sequences of step functions whose integrals are uniformly bounded above, this method, which is essentially a special case of the Daniell approach to abstract integration, avoids the somewhat tedious technical detail about measures that is required in the standard measuretheoretic introductions to the Lebesgue integral, and thereby enables us rapidly to reach the key results about convergence of sequences and series of integrable functions. The later sections of the notes contain material about the spaces Lp (R) of p–power integrable functions on R; a development of the Lebesgue double integral, including Fubini’s theorem about the equivalence of double and repeated integrals; and a discussion of topics in advanced di¤erentiation theory, such as Fubini’s series theorem and the Lebesgueintegral form of the fundamental theorem of calculus. Acknowledgement. These notes arose from material prepared by F.F. Bonsall and presented by J.C. Alexander to an honours course at the University of Edinburgh in 1967. I am grateful to those two gentlemen for inspiring my interest in Riesz’s work on the Lebesgue integral. 2 1