The Political Economy of Resource Rent Distribution

I model the link between political regime and level of diversification following a windfall of natural resource revenues. The explanatory variables I make use of are the political support functions embedded within each type of regime and the disparate levels of discretion, openness, transparency, and accountability of government. I show that a democratic government seeks to maximize the long-term consumption path of the representative consumer, in order to maximize its chances of re-election, while an authoritarian government, in the absence of any electoral mechanism of accountability, seeks to buy off and entrench a group of special interests loyal to the government and potent enough to ensure its short-term survival. Essentially the contrast in the approaches towards resource rent distribution comes down to a variation in political weights on aggregate welfare and rentierist special interests endogenized by distinct political support functions.

Multi-level SLA-driven resource management on Cloud Providers

Nowadays, service providers in the Cloud offer complex services ready to be used as it was a commodity like water or electricity to their customers with any other extra effort for them. However, providing these services implies a high management effort which requires a lot of human interaction. Furthermore, an efficient resource management mechanism considering only provider's resources is, though necessary, not enough, because the provider's profit is limited by the amount of resources it owns. Dynamically outsourcing resources to other providers in response to demand variation avoids this problem and makes the provider to get more profit. A key technology for achieving these goals is virtualization which facilitates provider's management and provides on-demand virtual environments, which are isolated and consolidated in order to achieve a better utilization of the provider's resources. Nevertheless, dealing with some virtualization capabilities implies an effort for the user in order to take benefit from them. In order to avoid this problem, we are contributing the research community with a virtualized environment manager which aims to provide virtual machines that fulfils with the user requirements. Another challenge is sharing resources among different federated Cloud providers while exploiting the features of virtualization in a new approach for facilitating providers' management. This project aims for reducing provider's costs and at the same time fulfilling the quality of service agreed with the customers while maximizing the provider's revenue. It considers resource management at several layers, namely locally to each node in the provider, among different nodes in the provider, and among different federated providers. This latter layer supports the novel capabilities of outsourcing when the local resources are not enough to fulfil the users demand, and offering resources to other providers when the local resources are underused.

Un cop d’ull a Resource description & acces (RDA) i al seu futur

Es tracta d’una sessió introductòria que se centra en els aspectes més generals de la nova normativa: el marc conceptual en el qual es fonamenta la RDA (els models FRBR i FRAD), els objectius, l’organització de les normes, el nou vocabulari, la continuïtat amb les AACR2 i els punts de divergència, els beneficis que s’espera obtenir del nou codi, etc. El seu objectiu principal és fer una primera introducció de les regles per sensibilitzar els catalogadors dels canvis que tindran lloc a mig termini.

Bandwidth allocation based on real time calculations using the convolution approach

This paper focuses on one of the methods for bandwidth allocation in an ATM network: the convolution approach. The convolution approach permits an accurate study of the system load in statistical terms by accumulated calculations, since probabilistic results of the bandwidth allocation can be obtained. Nevertheless, the convolution approach has a high cost in terms of calculation and storage requirements. This aspect makes real-time calculations difficult, so many authors do not consider this approach. With the aim of reducing the cost we propose to use the multinomial distribution function: the enhanced convolution approach (ECA). This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements and makes a simple deconvolution process possible. The ECA is used in connection acceptance control, and some results are presented

Alternation and Cooperation in a Two-party System: Implications for Resource-Based Developing Economies

This paper studies cooperation in a political system dominated by two opportunistic parties competing in a resource-based economy. Since a binding agreement as an external solution might be difficult to enforce due to the close association between the incumbent party and the government, the paper explores the extent to which co-operation between political parties that alternate in office can rely on self-enforcing strategies to provide an internal solution. We show that, for appropriate values of the probability of re-election and the discount factor cooperation in maintaining the value of a state variable is possible, but fragile. Another result is that, in such political framework, debt decisions contain an externality element linked to electoral incentives that creates a bias towards excessive borrowing.

Solving Large Location-Allocation problems by Clustering and Simulated Annealing

Globalization involves several facility location problems that need to be handled at large scale. Location Allocation (LA) is a combinatorial problem in which the distance among points in the data space matter. Precisely, taking advantage of the distance property of the domain we exploit the capability of clustering techniques to partition the data space in order to convert an initial large LA problem into several simpler LA problems. Particularly, our motivation problem involves a huge geographical area that can be partitioned under overall conditions. We present different types of clustering techniques and then we perform a cluster analysis over our dataset in order to partition it. After that, we solve the LA problem applying simulated annealing algorithm to the clustered and non-clustered data in order to work out how profitable is the clustering and which of the presented methods is the most suitable

A simulation-based algorithm for solving the resource-assignment problem in satellite telecommunication networks

This paper proposes an heuristic for the scheduling of capacity requests and the periodic assignment of radio resources in geostationary (GEO) satellite networks with star topology, using the Demand Assigned Multiple Access (DAMA) protocol in the link layer, and Multi-Frequency Time Division Multiple Access (MF-TDMA) and Adaptive Coding and Modulation (ACM) in the physical layer.

Optimum power allocation for parallel Gaussian channels with arbitrary input distributions

The mutual information of independent parallel Gaussian-noise channels is maximized, under an average power constraint, by independent Gaussian inputs whose power is allocated according to the waterfilling policy. In practice, discrete signalling constellations with limited peak-to-average ratios (m-PSK, m-QAM, etc) are used in lieu of the ideal Gaussian signals. This paper gives the power allocation policy that maximizes the mutual information over parallel channels with arbitrary input distributions. Such policy admits a graphical interpretation, referred to as mercury/waterfilling, which generalizes the waterfilling solution and allows retaining some of its intuition. The relationship between mutual information of Gaussian channels and nonlinear minimum mean-square error proves key to solving the power allocation problem.

Optimum power allocation for multiuser OFDM with arbitrary signal constellations

This paper formulates power allocation policies that maximize the region of mutual informationsachievable in multiuser downlink OFDM channels. Arbitrary partitioning ofthe available tones among users and arbitrary modulation formats, possibly different forevery user, are considered. Two distinct policies are derived, respectively for slow fadingchannels tracked instantaneously by the transmitter and for fast fading channels knownonly statistically thereby. With instantaneous channel tracking, the solution adopts theform of a multiuser mercury/waterfilling procedure that generalizes the single-user mercury/waterfilling introduced in [1, 2]. With only statistical channel information, in contrast,the mercury/waterfilling interpretation is lost. For both policies, a number of limitingregimes are explored and illustrative examples are provided.

Parental investments in children: how bargaining and educational homogamy affect time allocation

This study examines parental time investment in their children, distinguishing between developmental and non-developmental care. Our analyses centre on three influential determinants: educational background, marital homogamy, and spouses' relative bargaining power. We find that the emphasis on quality care time is correlated with parents' education, and that marital homogamy reduces couple specialization, but only among the highly educated. In line with earlier research, we identify gendered parental behaviour. The presence of boys is an important condition for fathers' time dedication, but primarly among lower educated fathers. To the extent that parental stimulation is decisive for child outcomes, our findings suggest the persistence of important inequalities. This emerges through our special attention to behavioural differences across the educational distribution among households.

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 the problem 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.

Money, Fame and the Allocation of Talent: Brain Drain, the Matthew Effect and the Institution of Science

The earning structure in science is known to be flat relative to the one in the private sector, which could cause a brain drain toward the private sector. In this paper, we assume that agents value both money and fame and study the role of the institution of science in the allocation of talent between the science sector and the private sector. Following works on the Sociology of Science, we model the institution of science as a mechanism distributing fame (i.e. peer recognition). We show that since the intrinsic performance is less noisy signal of talent in the science sector than in the private sector, a good institution of science can mitigate the brain drain. We also find that providing extra monetary incentives through the market might undermine the incentives provided by the institution and thereby worsen the brain drain. Finally, we study the optimal balance between monetary and non-monetary incentives in science.

Financial Repression in a Natural Experiment: Loan Allocation and the Change in the Usury Laws in 1714

If financial deepening aids economic growth, then financial repression should be harmful. We use a natural experiment – the change in the English usury laws in 1714 – to analyze the effects of interest rate restrictions. We use a sample of individual loan transactions to demonstrate how the reduction of the legal maximum rate of interest affected the supply and demand for credit. Average loan size and minimum loan size increased strongly, and access to credit worsened for those with little ‘social capital.’ While we have no direct evidence that loans were misallocated, the discontinuity in loan receipts makes this highly likely. We conclude that financial repression can undermine the positive effects of financial deepening.

Regional allocation of skills

This paper addresses three questions: (1) why does the share of skilledworkers in regional population tend to be higher in wealthier regions? (2)what determines changes in this share over time? and (3) why is it that internalmigration tends to raise average skill levels of the receiving regions relativeto that of the sending regions? I construct a two--region dynamic model withagglomeration and congestion to answer these questions. It is shown that,under certain relationship between wages and demand for land, unskilledworkers are discouraged more strongly from living in a wealthier region andare less mobile than skilled workers.

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.