Coalitional Games and Contracts Based on Individual Deviations

We study what coalitions form and how the members of each coalition split the coalition value in coalitional games in which only individual deviations are allowed. In this context we employ three stability notions: individual, contractual, and compensational stability. These notions differ in terms of the underlying contractual assumptions. We characterize the coalitional games in which individually stable outcomes exist by means of the top-partition property. Furthermore, we show that any coalition structure of maximum social worth is both contractually and compensationally stable.

Aspects géométriques et intégrables des modèles de matrices aléatoires

Travail réalisé en cotutelle avec l'université Paris-Diderot et le Commissariat à l'Energie Atomique sous la direction de John Harnad et Bertrand Eynard.

Les progressions arithmétiques dans les nombres entiers

Le sujet de cette thèse est l'étude des progressions arithmétiques dans les nombres entiers. Plus précisément, nous nous intéressons à borner inférieurement v(N), la taille du plus grand sous-ensemble des nombres entiers de 1 à N qui ne contient pas de progressions arithmétiques de 3 termes. Nous allons donc construire de grands sous-ensembles de nombres entiers qui ne contiennent pas de telles progressions, ce qui nous donne une borne inférieure sur v(N). Nous allons d'abord étudier les preuves de toutes les bornes inférieures obtenues jusqu'à présent, pour ensuite donner une autre preuve de la meilleure borne. Nous allons considérer les points à coordonnés entières dans un anneau à d dimensions, et compter le nombre de progressions arithmétiques qu'il contient. Pour obtenir des bornes sur ces quantités, nous allons étudier les méthodes pour compter le nombre de points de réseau dans des sphères à plusieurs dimensions, ce qui est le sujet de la dernière section.

Structures linéaires dans les ensembles à faible densité

Réalisé en cotutelle avec l'Université Paris-Diderot.

Antimedian graphs

Antimedian graphs are introduced as the graphs in which for every triple of vertices there exists a unique vertex x that maximizes the sum of the distances from x to the vertices of the triple. The Cartesian product of graphs is antimedian if and only if its factors are antimedian. It is proved that multiplying a non-antimedian vertex in an antimedian graph yields a larger antimedian graph. Thin even belts are introduced and proved to be antimedian. A characterization of antimedian trees is given that leads to a linear recognition algorithm.

On infinite graphs and related matrices

This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any system involving a binary relation. The theory is intimately related to many other branches of Mathematics including Matrix Theory Group theory. Probability. Topology and Combinatorics . and has applications in many other disciplines..Any sort of study on infinite graphs naturally involves an attempt to extend the well known results on the much familiar finite graphs. A graph is completely determined by either its adjacencies or its incidences. A matrix can convey this information completely. This makes a proper labelling of the vertices. edges and any other elements considered, an inevitable process. Many types of labelling of finite graphs as Cordial labelling, Egyptian labelling, Arithmetic labeling and Magical labelling are available in the literature. The number of matrices associated with a finite graph are too many For a study ofthis type to be exhaustive. A large number of theorems have been established by various authors for finite matrices. The extension of these results to infinite matrices associated with infinite graphs is neither obvious nor always possible due to convergence problems. In this thesis our attempt is to obtain theorems of a similar nature on infinite graphs and infinite matrices. We consider the three most commonly used matrices or operators, namely, the adjacency matrix

Strongly distance-balanced graphs and graph products

A graph G is strongly distance-balanced if for every edge uv of G and every i 0 the number of vertices x with d.x; u/ D d.x; v/ 1 D i equals the number of vertices y with d.y; v/ D d.y; u/ 1 D i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distancebalanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity O.mn/ for their recognition, wheremis the number of edges and n the number of vertices of the graph in question, are given

Region-Based Feature Interpretation for Recognizing 3D Models in 2D Images

In model-based vision, there are a huge number of possible ways to match model features to image features. In addition to model shape constraints, there are important match-independent constraints that can efficiently reduce the search without the combinatorics of matching. I demonstrate two specific modules in the context of a complete recognition system, Reggie. The first is a region-based grouping mechanism to find groups of image features that are likely to come from a single object. The second is an interpretive matching scheme to make explicit hypotheses about occlusion and instabilities in the image features.

Crosstalk between oestrogen receptors and thyroid hormone receptor isoforms results in differential regulation of the preproenkephalin gene

Nuclear receptors are ligand-activated transcription factors, which have the potential to integrate internal metabolic events in an organism, with consequences for control of behaviour. Previous studies from this laboratory have shown that thyroid hormone receptor (TR) isoforms can inhibit oestrogen receptor (ER)alpha-mediated induction of preproenkephalin (PPE) gene expression in the hypothalamus. Also, thyroid hormone administration inhibits lordosis, a behaviour facilitated by PPE expression. We have examined the effect of multiple ligand-binding TR isoforms on the ER-mediated induction of the PPE gene in transient transfection assays in CV-1 cells. On a natural PPE gene promoter fragment containing two putative oestrogen response elements (EREs), both ER alpha and beta isoforms mediate a four to five-fold induction by oestrogen. Cotransfection of TR alpha 1 along with ER alpha inhibited the ER alpha transactivation of PPE by approximately 50%. However, cotransfection with either TR beta 1 or TR beta 2 expression plasmids produced no effect on the ER alpha or ER beta mediated induction of PPE. Therefore, under these experimental conditions, interactions with a single ER isoform are specific to an individual TR isoform. Transfection with a TR alpha 1 DNA-binding mutant could also inhibit ER alpha transactivation, suggesting that competition for binding on the ERE may not be the exclusive mechanism for inhibition. Data with the coactivator, SRC-1, suggested that coactivator squelching may participate in the inhibition. In dramatic contrast, when ER beta is cotransfected, TR alpha 1 stimulated ER beta-mediated transactivation of PPE by approximately eight-fold over control levels. This is the first study revealing specific interactions among nuclear receptor isoforms on a neuroendocrine promoter. These data also suggest that the combinatorics of ER and TR isoforms allow multiple forms of flexible gene regulations in the service of neuroendocrine integration.