Regional income inequalities in Europe: an updated measurement and some decomposition results

In this paper well-known summary inequality indexes are used to explore interregional income inequalities in Europe. In particular, we mainly employ Theils’population-weighted index because of its appealing properties. Two decomposition analysis are applied. First, regional inequalities are decomposed by regional subgroups (countries). Second, intertemporal inequality changes are separated into income and population changes. The main results can be summarized as follows. First, data confirm a reduction in crossregional inequality during 1982-97. Second, this reduction is basically due to real convergence among countries. Third, currently the greater part of European interregional disparities is within-country by nature, which introduce an important challenge for the European policy. Fourth, inequality changes are due mainly to income variations, population changes playing a minor role.

Use and users of electronic journals at Catalan universities: the results of a survey

Es presenten els resultats d’una enquesta sobre l’ús de revistes electròniques realitzada al professorat de les universitats que formen el Consorci de Biblioteques Universitàries de Catalunya (CBUC). Els resultats mostren un elevat grau de coneixement de la col·lecció de revistes electròniques entre el personal docent i investigador i una creixent preferència pel format electrònic en detriment de l’imprès. L’alt grau de coneixement i d’ús dels títols electrònics, i la preferència per aquest suport, comporten una elevada valoració de la col·lecció de revistes electròniques. Al mateix temps, la major part dels usuaris preveu un increment de l’ús dels títols electrònics durant els propers anys. Els resultats també confirmen la importància de la disciplina i de l’edat com a factors explicatius de l’ús de les revistes electròniques.

The Private and fiscal returns to schooling and the effect of public policies on private incentives to invest in education: a general framework and some results for the EU

This paper develops a comprehensive framework for the quantitative analysis of the private and fiscal returns to schooling and of the effect of public policies on private incentives to invest in education. This framework is applied to 14 member states of the European Union. For each of these countries, we construct estimates of the private return to an additional year of schooling for an individual of average attainment, taking into account the effects of education on wages and employment probabilities after allowing for academic failure rates, the direct and opportunity costs of schooling, and the impact of personal taxes, social security contributions and unemployment and pension benefits on net incomes. We also construct a set of effective tax and subsidy rates that measure the effects of different public policies on the private returns to education, and measures of the fiscal returns to schooling that capture the long-term effects of a marginal increase in attainment on public finances under conditions that approximate general equilibrium.

Empirical studies in industrial location: an assessment of their methods and results

This paper surveys recent evidence on the determinants of (national and/or foreign) industrial location. We find that the basic analytical framework has remained essentially unaltered since the early contributions of the early 1980's while, in contrast, there have been significant advances in the quality of the data and, to a lesser extent, the econometric modelling. We also identify certain determinants (neoclassical and institutional factors) that tend to provide largely consistent results across the reviewed studies. In light of this evidence, we finally suggest future lines of research.

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.

Known and new results on absolute convergence of Fourier integrals

New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and its derivative. This result is extended to any dimension d &= 2.

Health care utilization among immigrants and native-born populations in 11 European countries. Results from the Survey of Health, Ageing and Retirement in Europe

Objective: This study examines health care utilization of immigrants relative to the native-born populations aged 50 years and older in eleven European countries. Methods. We analyzed data from the Survey of Health Aging and Retirement in Europe (SHARE) from 2004 for a sample of 27,444 individuals in 11 European countries. Negative Binomial regression was conducted to examine the difference in number of doctor visits, visits to General Practitioners (GPs), and hospital stays between immigrants and the native-born individuals. Results: We find evidence those immigrants above age 50 use health services on average more than the native-born populations with the same characteristics. Our models show immigrants have between 6% and 27% more expected visits to the doctor, GP or hospital stays when compared to native-born populations in a number of European countries. Discussion: Elderly immigrant populations might be using health services more intensively due to cultural reasons.

The analysis of approximate quickselect and related problems

Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficiently find an element with rank k in a given range [i..j], out of n given elements. We study basic cost measures of Approximate Quickselect by computing exact and asymptotic results for the expected number of passes, comparisons and data moves during the execution of this algorithm. The key element appearing in the analysis of Approximate Quickselect is a trivariate recurrence that we solve in full generality. The general solution of the recurrence proves to be very useful, as it allows us to tackle several related problems, besides the analysis that originally motivated us. In particular, we have been able to carry out a precise analysis of the expected number of moves of the ith element when selecting the jth smallest element with standard Quickselect, where we are able to give both exact and asymptotic results. Moreover, we can apply our general results to obtain exact and asymptotic results for several parameters in binary search trees, namely the expected number of common ancestors of the nodes with rank i and j, the expected size of the subtree rooted at the least common ancestor of the nodes with rank i and j, and the expected distance between the nodes of ranks i and j.

Optimal exponent heat balance and refined integral methods applied to Stefan problems

When using a polynomial approximating function the most contentious aspect of the Heat Balance Integral Method is the choice of power of the highest order term. In this paper we employ a method recently developed for thermal problems, where the exponent is determined during the solution process, to analyse Stefan problems. This is achieved by minimising an error function. The solution requires no knowledge of an exact solution and generally produces significantly better results than all previous HBI models. The method is illustrated by first applying it to standard thermal problems. A Stefan problem with an analytical solution is then discussed and results compared to the approximate solution. An ablation problem is also analysed and results compared against a numerical solution. In both examples the agreement is excellent. A Stefan problem where the boundary temperature increases exponentially is analysed. This highlights the difficulties that can be encountered with a time dependent boundary condition. Finally, melting with a time-dependent flux is briefly analysed without applying analytical or numerical results to assess the accuracy.

Testing, not modelling, the impact of cohesion support: a theoretical framework and some preliminary results for the Spanish regions

This paper develops a simple model that can be used to estimate the effectiveness of Cohesion expenditure relative to similar but unsubsidized projects, thereby making it possible to explicitly test an important assumption that is often implicit in estimates of the impact of Cohesion policies. Some preliminary results are reported for the case of infrastructure investment in the Spanish regions.

Signaling in Dynamic Contests: Some Impossibility Results

General signaling results in dynamic Tullock contests have been missing for long. The reason is the tractability of the problems. In this paper, an uninformed contestant with valuation vx competes against an informed opponent with valuation, either high vh or low vl. We show that; (i) When the hierarchy of valuations is vh ≥ vx ≥ vl, there is no pooling. Sandbagging is too costly for the high type. (ii) When the order of valuations is vx ≥ vh ≥ vl, there is no separation if vh and vl are close. Sandbagging is cheap due to the proximity of valuations. However, if vh and vx are close, there is no pooling. First period cost of pooling is high. (iii) For valuations satisfying vh ≥ vl ≥ vx, there is no separation if vh and vl are close. Bluffing in the first period is cheap for the low valuation type. Conversely, if vx and vl are close there is no pooling. Bluffing in the first stage is too costly. JEL: C72, C73, D44, D82. KEYWORDS: Signaling, Dynamic Contests, Non-existence, Sandbag Pooling, Bluff Pooling, Separating

Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges consist of two alternatives, in terms of two types of basic properties.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Relaxation methods for solving linear inequality systems: Converging results

The problem of finding a feasible solution to a linear inequality system arises in numerous contexts. In [12] an algorithm, called extended relaxation method, that solves the feasibility problem, has been proposed by the authors. Convergence of the algorithm has been proven. In this paper, we onsider a class of extended relaxation methods depending on a parameter and prove their convergence. Numerical experiments have been provided, as well.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.