Estimating Bayesian decision problems with heterogeneous priors

In many areas of economics there is a growing interest in how expertise andpreferences drive individual and group decision making under uncertainty. Increasingly, we wish to estimate such models to quantify which of these drive decisionmaking. In this paper we propose a new channel through which we can empirically identify expertise and preference parameters by using variation in decisionsover heterogeneous priors. Relative to existing estimation approaches, our \Prior-Based Identification" extends the possible environments which can be estimated,and also substantially improves the accuracy and precision of estimates in thoseenvironments which can be estimated using existing methods.

Median problems in networks

The P-median problem is a classical location model par excellence . In this paper we, firstexamine the early origins of the problem, formulated independently by Louis Hakimi andCharles ReVelle, two of the fathers of the burgeoning multidisciplinary field of researchknown today as Facility Location Theory and Modelling. We then examine some of thetraditional heuristic and exact methods developed to solve the problem. In the third sectionwe analyze the impact of the model in the field. We end the paper by proposing new lines ofresearch related to such a classical problem.

Enforcement problems and secondary markets

There is a large and growing literature that studies the effects of weak enforcement institutions on economic performance. This literature has focused almost exclusively on primary markets, in which assets are issued and traded to improve the allocation of investment and consumption. The general conclusion is that weak enforcement institutions impair the workings of these markets, giving rise to various inefficiencies.But weak enforcement institutions also create incentives to develop secondary markets, in which the assets issued in primary markets are retraded. This paper shows that trading in secondary markets counteracts the effects of weak enforcement institutions and, in the absence of further frictions, restores efficiency.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Solving higher-dimensional continuous time stochastic control problems by value function regression

The paper develops a method to solve higher-dimensional stochasticcontrol problems in continuous time. A finite difference typeapproximation scheme is used on a coarse grid of low discrepancypoints, while the value function at intermediate points is obtainedby regression. The stability properties of the method are discussed,and applications are given to test problems of up to 10 dimensions.Accurate solutions to these problems can be obtained on a personalcomputer.

Should banking supervision and monetary policy tasks be given to different agencies?

This paper adds some new arguments to the thesis that the responsibility forbanking supervision should be assigned to an agency formally separated bythe Central bank. We also provide some additional evidence on the macroand microeconomic performance of OECD countries whose banking systems areclassified according to the regulatory regime in place. We find that theinflation rate is considerably higher and more volatile in countries wherethe Central bank acts as a monopolist in banking supervision. Besides,although banks seem to be more profitable when Central banks supervise them,they incur into higher costs and rely more on deposits with respect to moresophisticated liabilities as a funding source.The data are not definitively in favor of functional separation. However, we argue that the evolution of financial intermediaries, moral hazard problems and especially cost accountability seem to suggest that separation would be a better solution for industrialized countries.We also critically discuss the current arrangement of financial regulationand supervision in the EMU: our proposal is to establish an independentEuropean System of Financial Supervisors (ESFS) structured similarly to theESCB.

Exploiting fitness distance correlation of set covering problems

The set covering problem is an NP-hard combinatorial optimization problemthat arises in applications ranging from crew scheduling in airlines todriver scheduling in public mass transport. In this paper we analyze searchspace characteristics of a widely used set of benchmark instances throughan analysis of the fitness-distance correlation. This analysis shows thatthere exist several classes of set covering instances that have a largelydifferent behavior. For instances with high fitness distance correlation,we propose new ways of generating core problems and analyze the performanceof algorithms exploiting these core problems.

Galois representations, embedding problems and modular forms

To an odd irreducible 2-dimensional complex linear representation of the absolute Galois group of the field Q of rational numbers, a modular form of weight 1 is associated (modulo Artin's conjecture on the L-series of the representation in the icosahedral case). In addition, linear liftings of 2-dimensional projective Galois representations are related to solutions of certain Galois embedding problems. In this paper we present some recent results on the existence of liftings of projective representations and on the explicit resolution of embedding problems associated to orthogonal Galois representations, and explain how these results can be used to construct modular forms.

Arithmetical problems in number fields, abelian varieties and modular forms

Number theory, a fascinating area in mathematics and one of the oldest, has experienced spectacular progress in recent years. The development of a deep theoretical background and the implementation of algorithms have led to new and interesting interrelations with mathematics in general which have paved the way for the emergence of major theorems in the area. This report summarizes the contribution to number theory made by the members of the Seminari de Teoria de Nombres (UB-UAB-UPC) in Barcelona. These results are presented in connection with the state of certain arithmetical problems, and so this monograph seeks to provide readers with a glimpse of some specific lines of current mathematical research.

Heterogeneous discounting in consumption-investment problems. Time consistent solutions

[cat] En aquest treball s'analitza un model estocàstic en temps continu en el que l'agent decisor descompta les utilitats instantànies i la funció final amb taxes de preferència temporal constants però diferents. En aquest context es poden modelitzar problemes en els quals, quan el temps s'acosta al moment final, la valoració de la funció final incrementa en comparació amb les utilitats instantànies. Aquest tipus d'asimetria no es pot descriure ni amb un descompte estàndard ni amb un variable. Per tal d'obtenir solucions consistents temporalment es deriva l'equació de programació dinàmica estocàstica, les solucions de la qual són equilibris Markovians. Per a aquest tipus de preferències temporals, s'estudia el model clàssic de consum i inversió (Merton, 1971) per a les funcions d'utilitat del tipus CRRA i CARA, comparant els equilibris Markovians amb les solucions inconsistents temporalment. Finalment es discuteix la introducció del temps final aleatori.

An agency-oriented model to explain vine-growing specialization in the province of Barcelona (Catalonia, Spain) in the mid-nineteenth century

[cat] En aquest treball presentem un model per explicar el procés d’especialització vitícola assolit als municipis de la província de Barcelona, a mitjans del s. XIX,que cerca entendre com va sorgir històricament un avantatge comparatiu fruit d’un procés que esdevindria un dels punts de partida del procés d’industrialització a Catalunya. Els resultats confirmen els papers jugats pel impuls “Boserupià” de la població en un context d’intensificació de l’ús de la terra, i d’un impuls del mercat “Smithià” en un context d’expansió de la demanda per part de les economies atlàntiques. També es posa de manifest la importància de les dotacions agro-ecològiques i les condicions socioinstitucionals relacionades amb la desigualtat d’ingrés. La difusió de la vinya donà com a resultat unes comunitats rurals menys desiguals fins al 1820, tot i que aquesta desigualtat augmentà de nou a partir d'aleshores.

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player

Some fundamental aspects of palentological methodology: its problems and incidence

Two trends which presently exist in relation to the concept of Paleontology are analyzed, pointing out some of the aspects which negative influence. Various reflections are made based on examples of some of the principal points of paleontological method, such as the influence of a punctual sampling, the meaning of size-frequency distribution and subjectivity in the identification of fossils. Topics which have a marked repercussion in diverse aspects of Paleontology are discussed.