Single period Markowitz portfolio selection, performance gauging and duality: a variation on Luenberger's shortage function

Markowitz portfolio theory (1952) has induced research into the efficiency of portfolio management. This paper studies existing nonparametric efficiency measurement approaches for single period portfolio selection from a theoretical perspective and generalises currently used efficiency measures into the full mean-variance space. Therefore, we introduce the efficiency improvement possibility function (a variation on the shortage function), study its axiomatic properties in the context of Markowitz efficient frontier, and establish a link to the indirect mean-variance utility function. This framework allows distinguishing between portfolio efficiency and allocative efficiency. Furthermore, it permits retrieving information about the revealed risk aversion of investors. The efficiency improvement possibility function thus provides a more general framework for gauging the efficiency of portfolio management using nonparametric frontier envelopment methods based on quadratic optimisation.

Permutations defining convex permutominoes

"Vegeu el resum a l'inici del document del fitxer adjunt."

Derived categories and Grothendieck duality

"Vegeu el resum a l'inici del document del fitxer adjunt."

Proper actions, fixed-point algebras and naturality in nonabelian duality

"Vegeu el resum a l'incici del document del fitxer adjunt."

Generic optimality conditions for semi-algebraic convex programs

We consider linear optimization over a nonempty convex semi-algebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique \active" manifold, around which F is \partly smooth", and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of the optimal solution. The active manifold consists, locally, of these perturbed optimal solutions; it is independent of the representation of F, and is eventually identified by a variety of iterative algorithms such as proximal and projected gradient schemes. These results extend to unbounded sets F.

Rigid flat webs on the projective plane

This paper studies global webs on the projective plane with vanishing curvature. The study is based on an interplay of local and global arguments. The main local ingredient is a criterium for the regularity of the curvature at the neighborhood of a generic point of the discriminant. The main global ingredient, the Legendre transform, is an avatar of classical projective duality in the realm of differential equations. We show that the Legendre transform of what we call reduced convex foliations are webs with zero curvature, and we exhibit a countable infinity family of convex foliations which give rise to a family of webs with zero curvature not admitting non-trivial deformations with zero curvature.

On stability of solutions to systems of convex inequalities

"Vegeu el resum a l'inici del document del fitxer adjunt."

Convex linear combination processes for compositions

Aitchison and Bacon-Shone (1999) considered convex linear combinations ofcompositions. In other words, they investigated compositions of compositions, wherethe mixing composition follows a logistic Normal distribution (or a perturbationprocess) and the compositions being mixed follow a logistic Normal distribution. Inthis paper, I investigate the extension to situations where the mixing compositionvaries with a number of dimensions. Examples would be where the mixingproportions vary with time or distance or a combination of the two. Practicalsituations include a river where the mixing proportions vary along the river, or acrossa lake and possibly with a time trend. This is illustrated with a dataset similar to thatused in the Aitchison and Bacon-Shone paper, which looked at how pollution in aloch depended on the pollution in the three rivers that feed the loch. Here, I explicitlymodel the variation in the linear combination across the loch, assuming that the meanof the logistic Normal distribution depends on the river flows and relative distancefrom the source origins

Refinement criteria for global illumination using convex funcions

In several computer graphics areas, a refinement criterion is often needed to decide whether to goon or to stop sampling a signal. When the sampled values are homogeneous enough, we assume thatthey represent the signal fairly well and we do not need further refinement, otherwise more samples arerequired, possibly with adaptive subdivision of the domain. For this purpose, a criterion which is verysensitive to variability is necessary. In this paper, we present a family of discrimination measures, thef-divergences, meeting this requirement. These convex functions have been well studied and successfullyapplied to image processing and several areas of engineering. Two applications to global illuminationare shown: oracles for hierarchical radiosity and criteria for adaptive refinement in ray-tracing. Weobtain significantly better results than with classic criteria, showing that f-divergences are worth furtherinvestigation in computer graphics. Also a discrimination measure based on entropy of the samples forrefinement in ray-tracing is introduced. The recursive decomposition of entropy provides us with a naturalmethod to deal with the adaptive subdivision of the sampling region

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

Duality in mean-variance frontiers with conditioning information

Portfolio and stochastic discount factor (SDF) frontiers are usually regarded as dual objects, and researchers sometimes use one to answer questions about the other. However, the introduction of conditioning information and active portfolio strategies alters this relationship. For instance, the unconditional portfolio frontier in Hansen and Richard (1987) is not dual to the unconditional SDF frontier in Gallant, Hansen and Tauchen (1990). We characterise the dual objects to those frontiers, and relate them to the frontiers generated with managed portfolios, which are commonly used in empirical work. We also study the implications of a safe asset and other special cases.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

Von Neumann-Morgenstern solution and convex descompositions of TU games

We study under which conditions the core of a game involved in a convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas¿ five player game with a unique stable set different from the core, are reckoning and analyzed.

A Note on Shapley's convex measure games

L. S. Shapley, in his paper 'Cores of Convex Games', introduces Convex Measure Games, those that are induced by a convex function on R, acting over a measure on the coalitions. But in a note he states that if this function is a function of several variables, then convexity for the function does not imply convexity of the game or even superadditivity. We prove that if the function is directionally convex, the game is convex, and conversely, any convex game can be induced by a directionally convex function acting over measures on the coalitions, with as many measures as players