Coauthorship and Thematic Networks in AAEP Annual Meetings

We analyze the coauthorship production of the AAEP Annual Meeting since 1964. We use social network analysis for creating coauthorship networks and given that any paper must be tagged with two JEL codes, we use this information for also structuring a thematic network. Then we calculate network metrics and find main actors and clusters for coauthors and topics. We distinguish a gender gap in the sample. Thematic networks show a cluster of codes and the analysis of the cluster shows the preeminence of the tags related to trade, econometric, distribution/poverty and health and education topics.Comment: 30 pages, 12 Figures, 16 Table

Optimal growth with intermediate goods interdependence: A difference game approach

Two countries face a strategic interdependence in producing intermediate goods. Producing these intermediate goods requires both of domestic capital and another imported intermediate good. Individually they determine its balanced growth path by taking into account this interdependence. By allowing for strategic interactions in the analysis we adapted a two-agent dynamic setting and find an interior Markov Perfect Equilibrium (MPE) as well as an open-loop equilibrium. We find that main results resemble each other but growth rates will be higher when strategies are allowed to be revised dynamically.Difference games; Economic growth; Intermediate goods

A Latent Budget Analysis Approach to Classification: Examples from Economics

Latent budget analysis is a classification technique that allows clustering identification by using compositional data. This paper presents examples of how this technique deals with the unit-sum constraint by establishing an initial independence model to which subsequent models are compared in terms of their relative fitness degree. In fact, latent budget analysis does not impose linearity, homogeneity, or even specific distributions on data. Results help to understand some important relationships between capital stock composition and income or food diet composition in a heterogeneous sample of countries.Latent budget analysis; compositional data; food composition; capital composition

Non Cooperatives Stackelberg Networks

Noncooperative network-formation games in oligopolies analyze optimal connection structures that emerge when linking represent the appropriation of cost-reducing one-way externalities. These models reflect situations where one firm access to another firm’s (public or private) information and this last cannot refuse it. What would happen if decisions are sequential? A model of exogenous Stackelberg leadership is developed and first-mover advantages are observed and commented.non cooperative games, network formation strategies, Stackelberg equilibrium.

A Compositional Statistical Analysis of Capital per Worker

Most of economic literature has presented its analysis under the assumption of homogeneous capital stock composition. However, capital composition differs across countries. What has been the pattern of capital composition associated with World economies? I make an exploratory statistical analysis based on the Aitchinson logratio transformations and the related tools for visualizing and measuring statistical estimators of association among the components. As initial findings could be cited that: 1. It is observed a clear correlation in terms of capital stock participation between two building-industry- related components, 2. Manufacturing behaves differently, especially durable goods sector. 3. There are differences among subsamples.compositional statistics, Aitchison logratio, capital structure, complementarities, comparative economics

Compositional Time Series: Past and Present

This survey reviews diverse academic production on compositional dynamic series analysis. Although time dimension of compositional series has been little investigated, this kind of data structure is widely available and utilized in social sciences research. This way, a review of the state-of-the-art on this topic is required for scientist to understand the available options. The review comprehends the analysis of several techniques like autoregresive integrate moving average (ARIMA) analysis, compositional vector autoregression systems (CVAR) and state space techniques but most of these are developed under Bayesian frameworks. As conclusion, this branch of the compositional statistical analysis still requires a lot of advances and updates and, for this same reason, is a fertile field for future research. Social scientists should pay attention to future developments due to the extensive availability of this kind of data structures in socioeconomic databases.compositional data analysis, time series

On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study

Variable elimination is a general technique for constraint processing. It is often discarded because of its high space complexity. However, it can be extremely useful when combined with other techniques. In this paper we study the applicability of variable elimination to the challenging problem of finding still-lifes. We illustrate several alternatives: variable elimination as a stand-alone algorithm, interleaved with search, and as a source of good quality lower bounds. We show that these techniques are the best known option both theoretically and empirically. In our experiments we have been able to solve the n=20 instance, which is far beyond reach with alternative approaches

Strategic economic growth with decreasing rates of time preference in a two-agent economy

This paper presents a two-agent economy, in which each agent has a consumption-dependent time preference. The optimal dynamic paths of accumulation will tend to one of many possible steady states, depending on the location of the initial capital level. The qualitative properties of this economic system have been analyzed elsewhere (Tohm´e and Dab´us, 2000). It has been shown that the interaction between the two agents may drag the poorest agent towards a higher steady state, getting her out of the potential poverty trap in which she could fall in isolation. We are interested now in studying specific functional forms of the joint production function, the utility functions and the psychological discount rates. The goal is to characterize both the individual and joint steady states in order to assess the advantages of interaction. Following the lead of (Dockner and Nishimura, 2004) we will obtain the subgame perfect equilibria of the economy seen as a two-person non-zero sum game. We will show that the non-linear convergence path towards the steady state examined by Tohm´e and Dab´us also obtains in a closed-loop solution.Fil: Larrosa, Juan Manuel Ceferino. Universidad Nacional del Sur. Departamento de Economía; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; ArgentinaFil: Tohmé, Fernando Abel. Universidad Nacional del Sur. Departamento de Economía; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentin

A Logical Approach to Efficient Max-SAT solving

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such. Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques. Most of this work focus on the computation of good quality lower bounds to be used within a branch and bound DPLL-like algorithm. Most often, these lower bounds are described in a procedural way. Because of that, it is difficult to realize the {\em logic} that is behind. In this paper we introduce an original framework for Max-SAT that stresses the parallelism with classical SAT. Then, we extend the two basic SAT solving techniques: {\em search} and {\em inference}. We show that many algorithmic {\em tricks} used in state-of-the-art Max-SAT solvers are easily expressable in {\em logic} terms with our framework in a unified manner. Besides, we introduce an original search algorithm that performs a restricted amount of {\em weighted resolution} at each visited node. We empirically compare our algorithm with a variety of solving alternatives on several benchmarks. Our experiments, which constitute to the best of our knowledge the most comprehensive Max-sat evaluation ever reported, show that our algorithm is generally orders of magnitude faster than any competitor