A simple access pricing rule to achieve the Ramsey outcome for interconnected networks

This paper considers a general and informationally efficient approach to determine the optimal access pricing rule for interconnected networks. It shows that there exists a simple rule that achieves the Ramsey outcome as the unique equilibrium when networks compete in linear prices without network-based price discrimination. The approach is informationally efficient in the sense that the regulator is required to know only the marginal cost structure, i.e. the marginal cost of making and terminating a call. The approach is general in that access prices can depend not only on the marginal costs but also on the retail prices, which can be observed by consumers and therefore by the regulator as well. In particular, I consider the set of linear access pricing rules which includes any fixed access price, the Efficient Component Pricing Rule (ECPR) and the Modified ECPR as special cases. I show that in this set, there is a unique rule that implements the Ramsey outcome as the unique equilibrium independently of the underlying demand conditions.

Bargaining on networks: An experiment

While markets are often decentralized, in many other cases agents in one role can only negotiate with a proper subset of the agents in the complementary role. There may be proximity issues or restricted communication flows. For example, information may be transmitted only through word-of-mouth, as is often the case for job openings, business opportunities, and confidential transactions. Bargaining can be considered to occur over a network that summarizes the structure of linkages among people. We conduct an alternating-offer bargaining experiment using separate simple networks, which are then joined during the session by an additional link. The results diverge sharply depending on how this connection is made. Payoffs can be systematically affected even for agents who are not connected by the new link. We use a graph-theoretic analysis to show that any two-sided network can be decomposed into simple networks of three types, so that our result can be generalized to more complex bargaining environments. Participants appear to grasp the essential characteristics of the networks and we observe a rather consistently high level of bargaining efficiency.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Emergence of Cooperation on Static and Dynamic Networks

Game theory is a branch of applied mathematics used to analyze situation where two or more agents are interacting. Originally it was developed as a model for conflicts and collaborations between rational and intelligent individuals. Now it finds applications in social sciences, eco- nomics, biology (particularly evolutionary biology and ecology), engineering, political science, international relations, computer science, and philosophy. Networks are an abstract representation of interactions, dependencies or relationships. Net- works are extensively used in all the fields mentioned above and in many more. Many useful informations about a system can be discovered by analyzing the current state of a network representation of such system. In this work we will apply some of the methods of game theory to populations of agents that are interconnected. A population is in fact represented by a network of players where one can only interact with another if there is a connection between them. In the first part of this work we will show that the structure of the underlying network has a strong influence on the strategies that the players will decide to adopt to maximize their utility. We will then introduce a supplementary degree of freedom by allowing the structure of the population to be modified along the simulations. This modification allows the players to modify the structure of their environment to optimize the utility that they can obtain.

Multinationals, technology networks and international takeovers

We formulate a knowlegde--based model of direct investment through mergers and acquisitions. M&As are realized to create comparative advantages by exploiting international synergies and appropriating local technology spillovers requiring geographical proximity, but can also represent a strategic response to the presence of a multinational rival. The takeover fee paid tends to increase with the strength of local spillovers which can thus work against multinationalization. Seller's bargaining power increases the takeover fee, but does not influence the investment decision. We characterize losers and winners from multinationalization, and show that foreign investment stimulates research but could result in a synergy trap reducing multinationals' profits.

Genome-wide association analysis of copy number variation in recurrent depressive disorder.

Large, rare copy number variants (CNVs) have been implicated in a variety of psychiatric disorders, but the role of CNVs in recurrent depression is unclear. We performed a genome-wide analysis of large, rare CNVs in 3106 cases of recurrent depression, 459 controls screened for lifetime-absence of psychiatric disorder and 5619 unscreened controls from phase 2 of the Wellcome Trust Case Control Consortium (WTCCC2). We compared the frequency of cases with CNVs against the frequency observed in each control group, analysing CNVs over the whole genome, genic, intergenic, intronic and exonic regions. We found that deletion CNVs were associated with recurrent depression, whereas duplications were not. The effect was significant when comparing cases with WTCCC2 controls (P=7.7 × 10(-6), odds ratio (OR) =1.25 (95% confidence interval (CI) 1.13-1.37)) and to screened controls (P=5.6 × 10(-4), OR=1.52 (95% CI 1.20-1.93). Further analysis showed that CNVs deleting protein coding regions were largely responsible for the association. Within an analysis of regions previously implicated in schizophrenia, we found an overall enrichment of CNVs in our cases when compared with screened controls (P=0.019). We observe an ordered increase of samples with deletion CNVs, with the lowest proportion seen in screened controls, the next highest in unscreened controls and the highest in cases. This may suggest that the absence of deletion CNVs, especially in genes, is associated with resilience to recurrent depression.

Recurrent hyperinflations and learning

This paper uses a model of boundedly rational learning to accountfor the observations of recurrent hyperinflations in the lastdecade. We study a standard monetary model where the fullyrational expectations assumption is replaced by a formaldefinition of quasi-rational learning. The model under learningis able to match remarkably well some crucial stylized factsobserved during the recurrent hyperinflations experienced byseveral countries in the 80's. We argue that, despite being asmall departure from rational expectations, quasi-rationallearning does not preclude falsifiability of the model and itdoes not violate reasonable rationality requirements.

Dyadic pulsations as a signature of sustainability in correspondence networks

In this paper, we introduce the concept of dyadic pulsations as a measure of sustainability in online discussion groups. Dyadic pulsations correspond to new communication exchanges occurring between two participants in a discussion group. A group that continuously integrates new participants in the on-going conversation is characterized by a steady dyadic pulsation rhythm. On the contrary, groups that either pursue close conversation or unilateral communication have no or very little dyadic pulsations. We show on two examples taken from Usenet discussion groups, that dyadic pulsations permit to anticipate future bursts in response delay time which are signs of group discussion collapses. We discuss ways of making this measure resilient to spam and other common algorithmic production that pollutes real discussions

Video-assisted right supradiaphragmatic thoracic duct ligation for non traumatic recurrent chylothorax

Introduction : Un chylothorax est une pathologie comprenant des manifestations respiratoires, nutritionnelles et immunologiques. La récidive du chylothorax ou l'échec du traitement conservateur imposent un traitement chirurgical. Ce travail rapporte notre expérience de ligature supra-diaphragmatique, vidéo-assistée du canal thoracique, pour chylothorax récurrent non traumatique. Patients et méthodes : Entre 1999 et 2004, nous avons recensé six observations (quatre du côté droit, un du côté gauche et un bilateral) Le chylothorax s'est développé chez trois patients traités par radio et chimiothérapie pour tumeur (deux lymphomes et une tumeur du sein) un dans le contexte d'une lymphangioléiomatose et un après greffe cardiaque. Résultats : Les patients ont bénéficié sous anesthésie générale, d'une ligature du canal thoracique supra-diaphragmatique, vidéo-assistée. Le temps opératoire moyen a été de 102 minutes. Le chylothorax a régressé chez cinq des six patients en sept jours. Un patient a été repris par thoracotomie droite au huitième jour pour chylothorax persistant. Dans la phase post-opératoire, un patient a développé une détresse respiratoire nécessitant une ventilation mécanique. Un autre patient a présenté un chylopéritoine important traité par un stent de Le Veen®. Le séjour moyen a été de quatorze jours sans mortalité péri-opératoire. Conclusion : Le traitement du chylothorax non traumatique récurrent est, en première intention, un traitement médical. En cas de récidive ou d'échec du traitement conservateur, le traitement chirurgical par ligature du canal thoracique supra- diaphragmatique, vidéo-assistée, permet de traiter avec succès le chylothorax récurrent non traumatique. -- Background: Chylothorax is an uncommon disorder with respiratory, nutritional and immunological manifestations. Surgical management is indicated in case of recurrence or failure after conservative treatment. We report our experience with video-assisted right-sided supradiaphrag¬matic thoracic duct ligation for non-traumatic, non-postoperative persistent or recurrent chylothorax. Patients and methods: The medical records of six patients operated at our institution between 1999 and 2004 were retrospectively reviewed. A right-sided chylothorax was found in four patients, a left-sided in one, and a bilateral in one. Three patients developed chylothorax after chemotherapy and chest irradiation for malignant diseases (lymphoma in two patients and breast cancer in one), one in the context of lymphangioleiomyomatosis, one due to a non-diagnosed lymphoma, and one after heart transplantation. Results: The mean operative time was 102 min, with an average length of hospital stay of 14 days. Persistent cessation of chylous effusion within 7 days after surgery was observed in 5/6 patients without recurrence during a mean follow-up time of 41 months. One patient with undiagnosed mediastinal lymphoma required re-operation and thoracic duct ligation on day 8 by right-sided thoracotomy due to persistent chylothorax. No 30-day mortality was recorded. Two patients presented postoperative complications including respiratory insufficiency requiring mechanical ventilation in one, and chylous ascites development requiring peritoneo-venous LeVeen shunting in one patient. Conclusions: Recurrent or persistent non-traumatic chylothorax may be successfully treated by video-assisted right supradiaphragmatic thoracic duct ligation.

Sagopilone (ZK-EPO, ZK 219477) for recurrent glioblastoma. A phase II multicenter trial by the European Organisation for Research and Treatment of Cancer (EORTC) Brain Tumor Group.

Background: Sagopilone (ZK 219477), a lipophylic and synthetic analog of epothilone B, that crosses the blood-brain barrier has demonstrated preclinical activity in glioma models.Patients and methods: Patients with first recurrence/progression of glioblastoma were eligible for this early phase II and pharmacokinetic study exploring single-agent sagopilone (16 mg/m(2) over 3 h every 21 days). Primary end point was a composite of either tumor response or being alive and progression free at 6 months. Overall survival, toxicity and safety and pharmacokinetics were secondary end points.Results: Thirty-eight (evaluable 37) patients were included. Treatment was well tolerated, and neuropathy occurred in 46% patients [mild (grade 1) : 32%]. No objective responses were seen. The progression-free survival (PFS) rate at 6 months was 6.7% [95% confidence interval (CI) 1.3-18.7], the median PFS was just over 6 weeks, and the median overall survival was 7.6 months (95% CI 5.3-12.3), with a 1-year survival rate of 31.6% (95% CI 17.7-46.4). Maximum plasma concentrations were reached at the end of the 3-h infusion, with rapid declines within 30 min after termination.Conclusions: No evidence of relevant clinical antitumor activity against recurrent glioblastoma could be detected. Sagopilone was well tolerated, and moderate-to-severe peripheral neuropathy was observed in despite prolonged administration.

Recurrent deletions and reciprocal duplications of 10q11.21q11.23 including CHAT and SLC18A3 are likely mediated by complex low-copy repeats.

We report 24 unrelated individuals with deletions and 17 additional cases with duplications at 10q11.21q21.1 identified by chromosomal microarray analysis. The rearrangements range in size from 0.3 to 12 Mb. Nineteen of the deletions and eight duplications are flanked by large, directly oriented segmental duplications of >98% sequence identity, suggesting that nonallelic homologous recombination (NAHR) caused these genomic rearrangements. Nine individuals with deletions and five with duplications have additional copy number changes. Detailed clinical evaluation of 20 patients with deletions revealed variable clinical features, with developmental delay (DD) and/or intellectual disability (ID) as the only features common to a majority of individuals. We suggest that some of the other features present in more than one patient with deletion, including hypotonia, sleep apnea, chronic constipation, gastroesophageal and vesicoureteral refluxes, epilepsy, ataxia, dysphagia, nystagmus, and ptosis may result from deletion of the CHAT gene, encoding choline acetyltransferase, and the SLC18A3 gene, mapping in the first intron of CHAT and encoding vesicular acetylcholine transporter. The phenotypic diversity and presence of the deletion in apparently normal carrier parents suggest that subjects carrying 10q11.21q11.23 deletions may exhibit variable phenotypic expressivity and incomplete penetrance influenced by additional genetic and nongenetic modifiers.