La forte hausse des rendements agricoles, observée tout au long des 150 dernières années, est, pour une large part, due à l’amélioration des variétés, résultant elle-même essentiellement de processus de recherche et développement. L’optimalité sociale de l’effort de recherche entrepris par les firmes de ce secteur, ainsi que des institutions encadrant l’activité de recherche, constituent un sujet important pour les politiques publiques. L’objet de cette thèse est de contribuer à éclairer cette question, en s’efforçant de tenir compte de l’impact sur l’environnement de l’innovation en matière de variétés agricoles. Nous examinons ce sujet à travers trois prismes différents : celui de l’innovation en tant que telle, celui du processus de recherche, et celui du cadre institutionnel offert aux entreprises de recherche. Nous montrons que la prise en compte des effets environnementaux de la recherche en modifie les optima, et devrait donc conduire à une adaptation du cadre incitatif et règlementaire. / The sharp increase in agricultural yields in the past 150 years owes a lot to the improvement of plant varieties, which, to large extent, is the result of the research and development process. Whether the research and development effort undertaken by firms operating in this sector and institutions regulating research are socially optimal is an important question for public policies. This thesis aims to contribute to tackling this issue, and its main contribution is to endeavor to account for the impact of crop innovation on the environment. We address the question through three different perspectives: innovation per se, the research and development process, and the institutional framework available to research firms. We show that environmental externalities of research significantly modify social optima.

Cette thèse se compose de quatre essais théoriques, portant sur le capital humain et la croissance. L'objectif est de proposer de nouvelles approches afin de mieux identifier l'impact des politiques éducatives. Plus précisément, dans les chapitres un à trois, nos analyses sont menées dans un cadre à deux secteurs, dans la mesure où les différents secteurs qui composent une économie ne sont pas influencés de la même façon par l'éducation. Dans le quatrième chapitre nous nous intéressons aux enjeux politiques liés à la gestion des problèmes environnementaux en considérant le lien entre éducation et environnement. / This dissertation consists of four essays on human capital and growth. It aims at proposing approaches to better understand the influence of education policy. Specifically, we take into account sectoral properties, since education does not affect each sector in the same way. We also deal with the link between education and the environment, to address environmental challenges that are one of the major political issues.

We study Social Groups consisting of self-interested inter-connected nodes looking for common content. We can observe Social Groups in various socio-technological networks, such as Cellular Network assisted Device-to-Device communications, Cloud assisted Peer-to-Peer Networks, hybrid Peer-to-Peer Content Distribution Networks and Direct Connect Networks. Each node wants to acquire a universe of segments at least cost. Nodes can either access an expensive link to the content distributor for downloading data segments, or use the well-connected low cost inter-node network for exchanging segments among themselves. Activation of an inter-node link requires cooperation among the participating nodes and reduces the cost of downloading for the nodes. However, due to uploading costs, Non-Reciprocating Nodes are reluctant to upload segments, in spite of their interest in downloading segments from others. We define the Give-and-Take (GT) criterion, which prohibits non-reciprocating behaviour in Social Groups for all nodes at all instants. In the “Full Exchange” case studied, two nodes can exchange copies of their entire segment sets, if each node gains at least one new segment from the other. Incorporating the GT criterion in the Social Group, we study the problem of downloading the universe at least cost, from the perspective of a new node having no data segments. We analyze this NP-hard problem, and propose algorithms for choosing the initial segments to be downloaded from the content distributor and the sequence of nodes for exchange. We compare the performance of these algorithms with a few existing P2P downloading strategies in terms of cost and running time. In the second problem, we attempt to reduce the load on the content distributor by choosing a schedule of inter-node link activations such that the number of nodes with the universe is maximized. Link activation decisions are taken by a central entity, the facilitator, for achieving the social optimum. We present the asymptotically optimal Randomized algorithm. We also present other algorithms, such as the Greedy Links algorithm and the Polygon algorithm, which are optimal under special scenarios of interest. We compare the performances of all proposed algorithms with the optimal value of the objective. We observe that computationally intensive algorithms exhibit better performance. Further, we consider the problem of decentralized scheduling of links. The decisions of link activations are made by the participating nodes in a distributed manner. While conforming to the GT criterion for inter-node exchanges, each node's objective is to maximize its utility. Each node tries to find a pairing partner by preferentially exploring nodes for link formation. Unpaired nodes choose to download a segment using the expensive link with Segment Aggressiveness Probability (SAP). We present linear complexity decentralized algorithms for nodes to choose their best strategy. We present a decentralized randomized algorithm that works in the absence of the facilitator and performs close to optimal for large number of nodes. We define the Price of Choice to benchmark performance of Social Groups (consisting of non-aggressive nodes) with the optimal. We evaluate the performance of various algorithms and characterize the behavioural regime that will yield best results for node and Social Group as well.