Search results for "uncertainty."

Bayesian hypothesis testing: A reference approach

2002

Summary For any probability model M={p(x|θ, ω), θeΘ, ωeΩ} assumed to describe the probabilistic behaviour of data xeX, it is argued that testing whether or not the available data are compatible with the hypothesis H0={θ=θ0} is best considered as a formal decision problem on whether to use (a0), or not to use (a0), the simpler probability model (or null model) M0={p(x|θ0, ω), ωeΩ}, where the loss difference L(a0, θ, ω) –L(a0, θ, ω) is proportional to the amount of information δ(θ0, ω), which would be lost if the simplified model M0 were used as a proxy for the assumed model M. For any prior distribution π(θ, ω), the appropriate normative solution is obtained by rejecting the null model M0 wh…

The simplex dispersion ordering and its application to the evaluation of human corneal endothelia

2009

A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Di…

The McKay conjecture and Galois automorphisms

2004

The main problem of representation theory of finite groups is to find proofs of several conjectures stating that certain global invariants of a finite group G can be computed locally. The simplest of these conjectures is the ?McKay conjecture? which asserts that the number of irreducible complex characters of G of degree not divisible by p is the same if computed in a p-Sylow normalizer of G. In this paper, we propose a much stronger version of this conjecture which deals with Galois automorphisms. In fact, the same idea can be applied to the celebrated Alperin and Dade conjectures.

On the Efficiency of Affine Invariant Multivariate Rank Tests

1998

AbstractIn this paper the asymptotic Pitman efficiencies of the affine invariant multivariate analogues of the rank tests based on the generalized median of Oja are considered. Formulae for asymptotic relative efficiencies are found and, under multivariate normal and multivariatetdistributions, relative efficiencies with respect to Hotelling'sT2test are calculated.

The Poincaré inequality is an open ended condition

2008

Let p > 1 and let (X,d,µ) be a complete metric measure space with µ Borel and doubling that admits a (1,p)-Poincare inequality. Then there exists e > 0 such that (X,d,µ) admits a (1,q)-Poincare inequality for every q > p - e, quantitatively.

BARGAINING WITH COMMITMENT UNDER AN UNCERTAIN DEADLINE

2006

We consider an infinite horizon bargaining game in which a deadline can arise with positive probability and where players possess an endogenous commitment device. We show that for any truncation of the game, the equilibrium agreement can only take place if the deadline arises within this finite horizon. Since the deadline is an uncertain event, the equilibrium exhibits agreements which are delayed with positive probability.

Quantum like modelling of decision making: quantifying uncertainty with the aid of the Heisenberg-Robertson inequality

2018

This paper contributes to quantum-like modeling of decision making (DM) under uncertainty through application of Heisenberg’s uncertainty principle (in the form of the Robertson inequality). In this paper we apply this instrument to quantify uncertainty in DM performed by quantum-like agents. As an example, we apply the Heisenberg uncertainty principle to the determination of mutual interrelation of uncertainties for “incompatible questions” used to be asked in political opinion pools. We also consider the problem of representation of decision problems, e.g., in the form of questions, by Hermitian operators, commuting and noncommuting, corresponding to compatible and incompatible questions …

Codification schemes and finite automata

2000

This paper is a note on how Information Theory and Codification Theory are helpful in the computational design both of communication protocols and strategy sets in the framework of finitely repeated games played by boundedly rational agents. More precisely, we show the usefulness of both theories to improve the existing automata bounds of Neyman¿s (1998) work on finitely repeated games played by finite automata.

On the propagation of error in certain non-linear algorithms

1959

Recursive and bargaining values

2021

Abstract We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value h…