A characterization of a new value and an existing value for cooperative games with levels structure of cooperation

En aquest treball presentem dues caracteritzacions de dos valors diferents en el marc dels jocs coalicionals amb cooperació restringida. Les restriccions són introduïdes com una seqüència finita de particions del conjunt del jugadors, de manera que cada una d'elles eés més grollera que l'anterior, formant així una estructura amb diferents nivells d'unions a priori.

Coalitionally monotonic set-solutions for cooperative TU games

A static comparative study on set-solutions for cooperative TU games is carried out. The analysis focuses on studying the compatibility between two classical and reasonable properties introduced by Young (1985) in the context of single valued solutions, namely core-selection and coalitional monotonicity. As the main result, it is showed that coalitional monotonicity is not only incompatible with the core-selection property but also with the bargaining-selection property. This new impossibility result reinforces the tradeoff between these kinds of interesting and intuitive economic properties. Positive results about compatibility between desirable economic properties are given replacing the core selection requirement by the core-extension property.

Aggregate monotonic stable single-valued solutions for cooperative games

[cat] En aquest treball caracteritzem les solucions puntuals de jocs cooperatius d'utilitat transferible que compleixen selecció del core i monotonia agregada. També mostrem que aquestes dues propietats són compatibles amb la individualitat racional, la propietat del jugador fals i la propietat de simetria. Finalment, caracteritzem les solucions puntuals que compleixen les cinc propietats a l'hora.

Generation of biological association networks: A novel strategy to detect new targets in cancer therapy

The aim of this work was to design a novel strategy to detect new targets for anticancer treatments. The rationale was to build Biological Association Networks from differentially expressed genes in drug-resistant cells to identify important nodes within the Networks. These nodes may represent putative targets to attack in cancer therapy, as a way to destabilize the gene network developed by the resistant cells to escape from the drug pressure. As a model we used cells resistant to methotrexate (MTX), an inhibitor of DHFR. Selected node-genes were analyzed at the transcriptional level and from a genotypic point of view. In colon cancer cells, DHFR, the AKR1 family, PKC¿, S100A4, DKK1, and CAV1 were overexpressed while E-cadherin was lost. In breast cancer cells, the UGT1A family was overexpressed, whereas EEF1A1 was overexpressed in pancreatic cells. Interference RNAs directed against these targets sensitized cells towards MTX.

Coworker networks in the labour market

This paper studies the role coworker-based networks play for individual labour marketoutcomes. I analyse how the provision of labour market relevant information by formercoworkers affects the employment probabilities and, if hired, the wages of male workerswho have previously become unemployed as the result of an establishment closure. Toidentify the causal effect of an individual worker's network on labour market outcomes, Iexploit exogenous variation in the strength of these networks that is due to the occurrenceof mass-layoffs in the establishments of former coworkers. The empirical analysis is basedon administrative data that comprise the universe of workers employed in Germany between1980 and 2001. The results suggest a strong positive effect of a higher employmentrate in a worker's network of former coworkers on his re-employment probability afterdisplacement: a 10 percentage point increase in the prevailing employment rate in thenetwork increases the re-employment probability by 7.5 percentage points. In contrast,there is no evidence of a statistically significant effect on wages.

Extrasynaptic neurotransmission in the modulation of brain function. Focus on the striatal neuronal glial networks

Extrasynaptic neurotransmission is an important short distance form of volume transmission (VT) and describes the extracellular diffusion of transmitters and modulators after synaptic spillover or extrasynaptic release in the local circuit regions binding to and activating mainly extrasynaptic neuronal and glial receptors in the neuroglial networks of the brain. Receptor-receptor interactions in G protein-coupled receptor (GPCR) heteromers play a major role, on dendritic spines and nerve terminals including glutamate synapses, in the integrative processes of the extrasynaptic signaling. Heteromeric complexes between GPCR and ion-channel receptors play a special role in the integration of the synaptic and extrasynaptic signals. Changes in extracellular concentrations of the classical synaptic neurotransmitters glutamate and GABA found with microdialysis is likely an expression of the activity of the neuron-astrocyte unit of the brain and can be used as an index of VT-mediated actions of these two neurotransmitters in the brain. Thus, the activity of neurons may be functionally linked to the activity of astrocytes, which may release glutamate and GABA to the extracellular space where extrasynaptic glutamate and GABA receptors do exist. Wiring transmission (WT) and VT are fundamental properties of all neurons of the CNS but the balance between WT and VT varies from one nerve cell population to the other. The focus is on the striatal cellular networks, and the WT and VT and their integration via receptor heteromers are described in the GABA projection neurons, the glutamate, dopamine, 5-hydroxytryptamine (5-HT) and histamine striatal afferents, the cholinergic interneurons, and different types of GABA interneurons. In addition, the role in these networks of VT signaling of the energy-dependent modulator adenosine and of endocannabinoids mainly formed in the striatal projection neurons will be underlined to understand the communication in the striatal cellular networks

Gene Ontology Function prediction in Mollicutes using Protein-Protein Association Networks

Abstract Background: Many complex systems can be represented and analysed as networks. The recent availability of large-scale datasets, has made it possible to elucidate some of the organisational principles and rules that govern their function, robustness and evolution. However, one of the main limitations in using protein-protein interactions for function prediction is the availability of interaction data, especially for Mollicutes. If we could harness predicted interactions, such as those from a Protein-Protein Association Networks (PPAN), combining several protein-protein network function-inference methods with semantic similarity calculations, the use of protein-protein interactions for functional inference in this species would become more potentially useful. Results: In this work we show that using PPAN data combined with other approximations, such as functional module detection, orthology exploitation methods and Gene Ontology (GO)-based information measures helps to predict protein function in Mycoplasma genitalium. Conclusions: To our knowledge, the proposed method is the first that combines functional module detection among species, exploiting an orthology procedure and using information theory-based GO semantic similarity in PPAN of the Mycoplasma species. The results of an evaluation show a higher recall than previously reported methods that focused on only one organism network.

Statistical mechanics of multi-edge networks

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Diffusion dynamics on multiplex networks

We study the time scales associated with diffusion processes that take place on multiplex networks, i.e., on a set of networks linked through interconnected layers. To this end, we propose the construction of a supra-Laplacian matrix, which consists of a dimensional lifting of the Laplacian matrix of each layer of the multiplex network. We use perturbative analysis to reveal analytically the structure of eigenvectors and eigenvalues of the complete network in terms of the spectral properties of the individual layers. The spectrum of the supra-Laplacian allows us to understand the physics of diffusionlike processes on top of multiplex networks.

Deciphering the global organization of clustering in real complex networks

We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.

Cooperative games with size-truncated information

[Eng] We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and that the Weber sets of consecutive levels form a chain if and only if the original game is 0-monotone. Even if the game is not 0-monotone, the intersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones. Spanish education system.

Cooperative games with size-truncated information

[Eng] We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and that the Weber sets of consecutive levels form a chain if and only if the original game is 0-monotone. Even if the game is not 0-monotone, the intersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones. Spanish education system.

Neural networks complemented with genetic algorithms and fuzzy systems for predicting nitrogenous effluent variables in wastewater treatment plants

This work focuses on the prediction of the two main nitrogenous variables that describe the water quality at the effluent of a Wastewater Treatment Plant. We have developed two kind of Neural Networks architectures based on considering only one output or, in the other hand, the usual five effluent variables that define the water quality: suspended solids, biochemical organic matter, chemical organic matter, total nitrogen and total Kjedhal nitrogen. Two learning techniques based on a classical adaptative gradient and a Kalman filter have been implemented. In order to try to improve generalization and performance we have selected variables by means genetic algorithms and fuzzy systems. The training, testing and validation sets show that the final networks are able to learn enough well the simulated available data specially for the total nitrogen

Efficiency of informational transfer in regular and complex networks

We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study nonclustered systems, we propose a modification of this measure on the local level. We apply this method to an extension of the class of small worlds that includes declustered networks and show that they are locally quite efficient, although their clustering coefficient is practically zero. Unweighted systems with small-world and scale-free topologies are shown to be both globally and locally efficient. Our method is also applied to characterize weighted networks. In particular we examine the properties of underground transportation systems of Madrid and Barcelona and reinterpret the results obtained for the Boston subway network.

Models of social networks based on social distance attachment

We propose a class of models of social network formation based on a mathematical abstraction of the concept of social distance. Social distance attachment is represented by the tendency of peers to establish acquaintances via a decreasing function of the relative distance in a representative social space. We derive analytical results (corroborated by extensive numerical simulations), showing that the model reproduces the main statistical characteristics of real social networks: large clustering coefficient, positive degree correlations, and the emergence of a hierarchy of communities. The model is confronted with the social network formed by people that shares confidential information using the Pretty Good Privacy (PGP) encryption algorithm, the so-called web of trust of PGP.