The goal of this paper is to estimate time-varying covariance matrices. Since the covariance matrix of financial returns is known to change through time and is an essential ingredient in risk measurement, portfolio selection, and tests of asset pricing models, this is a very important problem in...

The central message of this paper is that nobody should be using the sample covariance matrix for the purpose of portfolio optimization. It contains estimation error of the kind most likely to perturb a mean-variance optimizer. In its place, we suggest using the matrix obtained from the sample...

In many areas of economics there is a growing interest in how expertise and preferences drive individual and group decision making under uncertainty. Increasingly, we wish to estimate such models to quantify which of these drive decision making. In this paper we propose a new channel through...

In this paper we present an algorithm to assign proctors to exams. This NP-hard problem is related to the generalized assignment problem with multiple objectives. The problem consists of assigning teaching assistants to proctor final exams at a university. We formulate this problem as a...

Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the...

The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...

A general formalism on stochastic choice is presented. Tje Rationalizability and Recoverability (Identification) problems are discussed. For the identification issue parametric examples are analyzed by means of techniques of mathematical tomography (Random transforms).

We construct an uncoupled randomized strategy of repeated play such that, if every player follows such a strategy, then the joint mixed strategy profiles converge, almost surely, to a Nash equilibrium of the one-shot game. The procedure requires very little in terms of players' information about...