Two Waves of Globalisation: Superficial Similarities, Fundamental Differences

This paper looks at the two waves of globalisation (roughly 1820-1914 and 1960-present) focusing on key economic facts (trade investment, migration, and capital flows, Industrialisation/de-industrialisation convergence/divergence) beliefs and policymaking environments. The two waves are superficial similarities but are fundamentally different. Chief similarities include aggregate trade and capital flow ratios, and the importance of reductions in barriers to international transactions. The fundamental difference lies in the impact that these reductions had on trade in goods versus trade in ideas. Initial conditions constitute another important difference. Before the first wave, all the world was poor and agrarian. When the second wave began, it was sharply divided between rich and poor nations.

The effects of entry on incumbent innovation and productivity

How does firm entry affect innovation incentives in incumbent firms? Microdata suggest that there is heterogeneity across industries. Specifically, incumbent productivity growth and patenting is positively correlated with lagged greenfield foreign firm entry in technologically advanced industries, but not in laggard industries. In this paper we provide evidence that these correlations arise from a causal effect predicted by Schumpeterian growth theory—the threat of technologically advanced entry spurs innovation incentives in sectors close to the technology frontier, where successful innovation allows incumbents to survive the threat, but discourages innovation in laggard sectors, where the threat reduces incumbents' expected rents from innovating. We find that the empirical patterns hold using rich micro panel data for the United Kingdom. We control for the endogeneity of entry by exploiting major European and U.K. policy reforms, and allow for endogeneity of additional factors. We complement the analysis for foreign entry with evidence for domestic entry and entry through imports

Improving QED-Tutrix by Automating the Generation of Proofs

The idea of assisting teachers with technological tools is not new. Mathematics in general, and geometry in particular, provide interesting challenges when developing educative softwares, both in the education and computer science aspects. QED-Tutrix is an intelligent tutor for geometry offering an interface to help high school students in the resolution of demonstration problems. It focuses on specific goals: 1) to allow the student to freely explore the problem and its figure, 2) to accept proofs elements in any order, 3) to handle a variety of proofs, which can be customized by the teacher, and 4) to be able to help the student at any step of the resolution of the problem, if the need arises. The software is also independent from the intervention of the teacher. QED-Tutrix offers an interesting approach to geometry education, but is currently crippled by the lengthiness of the process of implementing new problems, a task that must still be done manually. Therefore, one of the main focuses of the QED-Tutrix' research team is to ease the implementation of new problems, by automating the tedious step of finding all possible proofs for a given problem. This automation must follow fundamental constraints in order to create problems compatible with QED-Tutrix: 1) readability of the proofs, 2) accessibility at a high school level, and 3) possibility for the teacher to modify the parameters defining the "acceptability" of a proof. We present in this paper the result of our preliminary exploration of possible avenues for this task. Automated theorem proving in geometry is a widely studied subject, and various provers exist. However, our constraints are quite specific and some adaptation would be required to use an existing prover. We have therefore implemented a prototype of automated prover to suit our needs. The future goal is to compare performances and usability in our specific use-case between the existing provers and our implementation.Comment: In Proceedings ThEdu'17, arXiv:1803.0072

Experimental compaction of anisotropic granular media

We report on experiments to measure the temporal and spatial evolution of packing arrangements of anisotropic and weakly confined granular material, using high-resolution $\gamma$-ray adsorption. In these experiments, the particle configurations start from an initially disordered, low-packing-fraction state and under vertical solicitations evolve to a dense state. We find that the packing fraction evolution is slowed by the grain anisotropy but, as for spherically shaped grains, can be well fitted by a stretched exponential. For a given type of grains, the characteristic times of relaxation and of convection are found to be of the same order of magnitude. On the contrary compaction mechanisms in the media strongly depend on the grain anisotropy.Comment: to appear in the european physical journal E (EPJE

Transferring new dynamic capabilities to SMEs: the role of ONERA – the French Aerospace LabTM in promoting asymmetries management

The technology transfer process between a public laboratory and a company has been the subject of many publications and has been widely discussed in economic theory. This paper highlights several newly identified asymmetries occurring between the different agents taking part in the process, dealing specifically with the aerospace and defense sectors in France. These specificities concern the characteristics, capabilities and competencies (the ‘capacities') of French SMEs and public research laboratories. The theoretical corpus of the article draws partly upon the analyses of ‘dynamic and interactive capabilities' (and competencies), and for the rest upon empirical sources, being based on the recent experience of one of the most dynamic Technology Transfer Offices (TTOs) in France: the case of ONERA (the National Office for Aerospace Studies and Research) and its dyadic relations with the SMEs. In such a cooperative, interactive innovation process, we will argue that certain collaborative tools or practices emerge, aimed at reducing information asymmetries or acting as compensation mechanisms for other types of asymmetries between the partners at a microeconomic level; especially in France where there is a gap between the public R&D laboratories and the SMEs in terms of Technology Readiness Levels (TRLs). Some of these compensation mechanisms, particularly those related to the knowledge economy, could be adapted and reshaped for agents engaged in R&D and innovation in various other sectors, perhaps inducing positive amplification effects on innovation behavior, and thereby on economic growth at the macroeconomic level within the “national innovation system”. This research work initiated by the author further to his economic research works on “innovation actors' asymmetries” (Paun, F., 2009) and “hybridizing tendency of the innovation approaches” (Paun, F., 2010) is based on the empirical study about eighty SMEs partners of ONERA coordinated by Florin Paun as Deputy Director in charge with Industrial Innovation at ONERA in order to better understand the barriers perceived inside this relationship and with the aim to envisage systemic solutions for accelerating innovation. A specific questionnaire has been developed by Florin Paun and more then forty interviews have been thus conducted with scientists and industrial representatives involved in direct collaborations linked to technology or knowledge transfer.French SMEs, technology transfer, information asymmetries, dynamic capabilities, innovation systems

Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem

We consider the class of (finite) spatial games. We show that the problem of determining whether there exists a Nash equilibrium in which each player has a payoff of at least k is NP-complete as a function of the number of players. When each player has two strategies and the base game is an anti-coordination game, the problem is decidable in polynomial time.spatial games; NP-completeness; graph K-colorability

Average tree solutions for graph games

In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and Herings, van der Laan, Talman and Yang [7]. Each average tree solution is defined with re- spect to a set, say T , of admissible rooted spanning trees. Each average tree solution is characterized by efficiency, linearity and an axiom of T - hierarchy on the class of all graph games with a fixed communication graph. We also establish that the set of admissible rooted spanning trees introduced by Herings, van der Laan, Talman and Yang [7] is the largest set of rooted spanning trees such that the corresponding aver- age tree solution is a Harsanyi solution. One the other hand, we show that this set of rooted spanning trees cannot be constructed by a dis- tributed algorithm. Finally, we propose a larger set of spanning trees which coincides with the set of all rooted spanning trees in clique-free graphs and that can be computed by a distributed algorithm.