Non-constant discounting in finite horizon: The free terminal time case

This paper derives the HJB (Hamilton-Jacobi-Bellman) equation for sophisticated agents in a finite horizon dynamic optimization problem with non-constant discounting in a continuous setting, by using a dynamic programming approach. A simple example is used in order to illustrate the applicability of this HJB equation, by suggesting a method for constructing the subgame perfect equilibrium solution to the problem.Conditions for the observational equivalence with an associated problem with constantdiscounting are analyzed. Special attention is paid to the case of free terminal time. Strotz¿s model (an eating cake problem of a nonrenewable resource with non-constant discounting) is revisited.

Predicting spinor condensate dynamics from simple principles

We study the spin dynamics of quasi-one-dimensional F=1 condensates both at zero and finite temperatures for arbitrary initial spin configurations. The rich dynamical evolution exhibited by these nonlinear systems is explained by surprisingly simple principles: minimization of energy at zero temperature and maximization of entropy at high temperature. Our analytical results for the homogeneous case are corroborated by numerical simulations for confined condensates in a wide variety of initial conditions. These predictions compare qualitatively well with recent experimental observations and can, therefore, serve as a guidance for ongoing experiments.

Finite mixture analysis of beauty-contest data using generalised beta distributions

This paper introduces a mixture model based on the beta distribution, without preestablishedmeans and variances, to analyze a large set of Beauty-Contest data obtainedfrom diverse groups of experiments (Bosch-Domenech et al. 2002). This model gives a bettert of the experimental data, and more precision to the hypothesis that a large proportionof individuals follow a common pattern of reasoning, described as iterated best reply (degenerate),than mixture models based on the normal distribution. The analysis shows thatthe means of the distributions across the groups of experiments are pretty stable, while theproportions of choices at dierent levels of reasoning vary across groups.

Technical Note: Dissolved organic matter fluorescence a finite mixture approach to deconvolve excitation-emission matrices

The analysis of the shape of excitation-emission matrices (EEMs) is a relevant tool for exploring the origin, transport and fate of dissolved organic matter (DOM) in aquatic ecosystems. Within this context, the decomposition of EEMs is acquiring a notable relevance. A simple mathematical algorithm that automatically deconvolves individual EEMs is described, creating new possibilities for the comparison of DOM fluorescence properties and EEMs that are very different from each other. A mixture model approach is adopted to decompose complex surfaces into sub-peaks. The laplacian operator and the Nelder-Mead optimisation algorithm are implemented to individuate and automatically locate potential peaks in the EEM landscape. The EEMs of a simple artificial mixture of fluorophores and DOM samples collected in a Mediterranean river are used to describe the model application and to illustrate a strategy that optimises the search for the optimal output.

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.

Distortion of surface groups in Cat (0) free-by-cyclic groups

Given a non-positively curved 2-complex with a circle-valued Morse function satisfying some extra combinatorial conditions, we describe how to locally isometrically embed this in a larger non- positively curved 2-complex with free-by-cyclic fundamental group. This embedding procedure is used to produce examples of CAT(0) free-by-cyclic groups that contain closed hyperbolic surface subgroups with polynomial distortion of arbitrary degree. We also produce examples of CAT(0) hyperbolic free-by-cyclic groups that contain closed hyperbolic surface subgroups that are exponentially distorted.

RECASTING THE ELLIOTT CONJECTURE

Let A be a simple, unital, finite, and exact C*-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup which is obtained from the Elliott invariant in a functorial manner. We conjecture that this embedding is an isomor phism, and prove the conjecture in several cases. In these same cases - Z-stable algebras all - we prove that the Elliott conjecture in its strongest form is equivalent to a conjecture which appears much weaker. Outside the class of Z-stable C*-algebras, this weaker conjecture has no known counterexamples, and it is plausible that none exist. Thus, we reconcile the still intact principle of Elliott's classification conjecture -that K-theoretic invariants will classify separable and nuclear C*-algebras- with the recent appearance of counterexamples to its strongest concrete form.

The Zariski-Lefschetz principle for higher homotopy groups of nongeneric pencils

We prove a general Zariski-van Kampen-Lefschetz type theorem for higher homotopy groups of generic and nongeneric pencils on singular open complex spaces.

Metrics on diagram groups and uniform embeddings in a Hilbert space

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

Testing Cayley graph densities

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.

Pressure groups and experts in environmental regulation

We study a problem of adverse selection in the context of environmental regulation, where the firm may suffer from a certain degree of ignorance about its own type. In a framework like the construction of a certain infrastructure project, the presence of ignorance about its impact on the environment, can play an important role in the determination of the regulatory policy. First, an optimal contract is constructed for any exogenous level of ignorance. Second, the presence of potentially informed third-parties is studied from the perspective of the regulator, which allows us to analyze the impact on the efficiency of the contract, of the presence of environmentalists and of experts. Then, we obtain some insights on how the problem differs when the degree of ignorance is a choice variable for the firm. We finally use our results to derive policy implications concerning the existing envoronmental regulation, and the potential role of interested parties as information providers.

Pure braid subgroups of braided Thompson's groups

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

Inequality in CO2 emissions across countries and its relationship with income inequality: a distributive approach

This paper analyses the inequality in CO2 emissions across countries (and groups of countries) and the relationship of this inequality with income inequality across countries for the period (1971-1999). The research employs the tools that are usually applied in income distribution analysis. The methodology used here gives qualitative and quantitative information on some of the features of the inequalities across countries that are considered most relevant for the design and discussion of policies aimed at mitigating climate change. The paper studies the relationship between CO2 emissions and GDP and shows that income inequality across countries has been followed by an important inequality in the distribution of emissions. This inequality has diminished mildly, although the inequality in emissions across countries ordered in the increasing value of income (inequality between rich and poor countries) has diminished less than the “simple” inequality in emissions. Lastly, the paper shows that the inequality in CO2 emissions is mostly explained by the inequality between groups with different per capita income level. The importance of the inequality within groups of similar per capita income is much lower and has diminished during the period, especially in the low-middle income group.

Endogenous population subgroups: the best population partition and optimal number of groups

The aim of this paper is to suggest a method to find endogenously the points that group the individuals of a given distribution in k clusters, where k is endogenously determined. These points are the cut-points. Thus, we need to determine a partition of the N individuals into a number k of groups, in such way that individuals in the same group are as alike as possible, but as distinct as possible from individuals in other groups. This method can be applied to endogenously identify k groups in income distributions: possible applications can be poverty