Evidence such as the Ellsberg Paradox shows that decision-makers do not assign probabilities to all events. It is intuitive that they may differ not only in the probabilities assigned to given events but also in the identity of the events to which they assign probabilities. This paper describes...

In optimization, objective functions which are both pseudoconvex and pseudoconcave have extensively been studied. Generalizing these results, we characterize pseudomonotone maps F where also -F is pseudomonotone and explore their properties in variational inequality problems. In particular, we...

Duality is studied for an abstract equilibrium problem which includes, among others, optimization problems and variational inequality problems. Follwing different schemes, various duals are proposed and primal-dual relationships are established under certaing generalized convexity and...

This paper proposes a Bayesian method of performance evaluation for investment managers. We begin with a flexible set of prior beliefs that can be elicited without any reference to probability distributions or their parameters. We then combine these prior beliefs with a general multi-factor...

A robust principal component analysis can be easily performed by computing the eigenvalues and eigenvectors of a robust estimator of the covariance or correlation matrix. In this paper the authors derive the influence functions and the corresponding asumptotic variances for these robust...

Bergin and Lipman (1996) show that the refinement effect from the random mutations in the adaptive population dynamics in Kandori, Mailath and Rob (1993) and Young (1993) is due to restrictions on how these mutation rates vary across population states. We here model mutation rates as...

We build spaces of q.p. (quasi-periodic) functions and we establich some of their properties. They are motivated by the Perceival approach to q.p. solutions of Hamiltonian systems. The periodic solutions of an adequat Partial Differential Equation are related to the q.p. solutions of an Ordinar...

In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.

Five decades ago, Bhattacharyya established a series of lower bounds for the variance of an unbiased estimator, since then called the Bhattacharyya bounds. In 1974 Blight and Rao have shown that the series of Bhattacharyya bounds converges to the variance of the best unbiased estimator. In this...