Mixture sets were introduced by Herstein and Milnor (1953) into decision theory, where they are still widely used. This note clarifies the formal connection between mixture sets and convex sets. The results suggest that the former concept might be unnecessary for decision- theoretic purposes.

The critical role of free entry to correct inherent deviance behavior has been stressed by Vanek (1970), Meade (1972) amongst others. The equivalence theorem (Dreze 1976) defines that labour and entrepreneurial management both lead to the same Pareto optimal equilibrium provided that there is...

The paper proposes an original class of conditionally heteroskedastic models aimed to capture a new concept of asymmetry. Not only past up and down moves of stock market returns have different impacts on the conditional variance, but also, positive and negative changes are governed by different...

In Van den Akker, Van Hoesel, and Savelsbergh (1994), we have studied a time-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand side 1 and 2 for the convex hull of the monotone extension of...

Classically, the concept of efficiency measurement is based on the definition of a frontier that envelops the observed production plans. The efficiency score itself is based on the distance of an observed production plan from this frontier. The frontier along with the required technological...

This paper demonstrates that the bootstrap procedure suggested by Ferrier and Hirschberg (1997) gives inconsistent estimates. A very simple example is given to illustrate the statistical issues underlying nonparametric efficiency measurement and the problems with the Ferrier/Hirschberg approach,...

An extremely simple proof of the K-K-M-S Theorem is given involving only Brouwer's fixed point theorem and some elementary calculus.

In this paper we consider a new analytic center cutting plane method in a projective space. We prove the efficiency estimates for the general schemeand show that these results can be used in the analysis of a feasibility problem, the variational inequality problem and the problem of constrained...

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.

In this paper, I first prove an integral representation theorem: Every quasi-integral on a Stone lattice can be represented by a unique upper-continuous capacity. I then apply this representation theorem to study the topological structure of the space of all upper-continuous capacities on a...