Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.

Less Risk, More Effort : Demand Risk Allocation in Incomplete Contracts

This article investigates the allocation of demand risk within an incomplete contract framework. We consider an incomplete contractual relationship between a public authority and a private provider (i.e. a public-private partnership), in which the latter invests in non-verifiable cost-reducing efforts and the former invests in non-verifiable adaptation efforts to respond to changing consumer demand over time. We show that the party that bears the demand risk has fewer hold-up opportunities and that this leads the other contracting party to make more effort. Thus, in our model, bearing less risk can lead to more effort, which we describe as a new example of âeuro~counter-incentivesâeuro?. We further show that when the benefits of adaptation are important, it is socially preferable to design a contract in which the demand risk remains with the private provider, whereas when the benefits of cost-reducing efforts are important, it is socially preferable to place the demand risk on the public authority. We then apply these results to explain two well-known case studies.

Patterns of dry matter partitioning and 14C-photosynthate allocation in 1.5-year-old Scots pine seedlings

Summary

Optimal T-cell receptor affinity for inducing autoimmunity.

T-cell receptor affinity for self-antigen has an important role in establishing self-tolerance. Three transgenic mouse strains expressing antigens of variable affinity for the OVA transgenic-I T-cell receptor were generated to address how TCR affinity affects the efficiency of negative selection, the ability to prime an autoimmune response, and the elimination of the relevant target cell. Mice expressing antigens with an affinity just above the negative selection threshold exhibited the highest risk of developing experimental autoimmune diabetes. The data demonstrate that close to the affinity threshold for negative selection, sufficient numbers of self-reactive T cells escape deletion and create an increased risk for the development of autoimmunity.

Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player

Monge assignment games

Un juego de asignación se define por una matriz A; donde cada fila representa un comprador y cada columna un vendedor. Si el comprador i se empareja a un vendedor j; el mercado produce aij unidades de utilidad. Estudiamos los juegos de asignación de Monge, es decir, aquellos juegos bilaterales de asignación en los cuales la matriz satisface la propiedad de Monge. Estas matrices pueden caracterizarse por el hecho de que en cualquier submatriz 2x2 un emparejamiento óptimo está situado en la diagonal principal. Para mercados cuadrados, describimos sus núcleos utilizando sólo la parte central tridiagonal de elementos de la matriz. Obtenemos una fórmula cerrada para el reparto óptimo de los compradores dentro del núcleo y para el reparto óptimo de los vendedores dentro del núcleo. Analizamos también los mercados no cuadrados reduciéndolos a matrices cuadradas apropiadas.

Symmetrically multilateral-bargained allocations in multi-sided assignment markets

[cat] Aquest treball tracta d’extendre la noció d’equilibri simètric de negociació bilateral introduït per Rochford (1983) a jocs d’assignació multilateral. Un pagament corresponent a un equilibri simètric de negociación multilateral (SMB) és una imputación del core que garanteix que qualsevol agent es troba en equilibri respecte a un procés de negociación entre tots els agents basat en allò que cadascun d’ells podria rebre -i fer servir com a amenaça- en un ’matching’ òptim diferent al que s’ha format. Es prova que, en el cas de jocs d’assignació multilaterals, el conjunt de SMB és sempre no buit i que, a diferència del cas bilateral, no sempre coincideix amb el kernel (Davis and Maschler, 1965). Finalment, responem una pregunta oberta per Rochford (1982) tot introduïnt un conjunt basat en la idea de kernel, que, conjuntament amb el core, ens permet caracteritzar el conjunt de SMB.

Optimal perfusion computed tomographic thresholds for ischemic core and penumbra are not time dependent in the clinically relevant time window.

BACKGROUND AND PURPOSE: This study aims to determine whether perfusion computed tomographic (PCT) thresholds for delineating the ischemic core and penumbra are time dependent or time independent in patients presenting with symptoms of acute stroke. METHODS: Two hundred seventeen patients were evaluated in a retrospective, multicenter study. Patients were divided into those with either persistent occlusion or recanalization. All patients received admission PCT and follow-up imaging to determine the final ischemic core, which was then retrospectively matched to the PCT images to identify optimal thresholds for the different PCT parameters. These thresholds were assessed for significant variation over time since symptom onset. RESULTS: In the persistent occlusion group, optimal PCT parameters that did not significantly change with time included absolute mean transit time, relative mean transit time, relative cerebral blood flow, and relative cerebral blood volume when time was restricted to 15 hours after symptom onset. Conversely, the recanalization group showed no significant time variation for any PCT parameter at any time interval. In the persistent occlusion group, the optimal threshold to delineate the total ischemic area was the relative mean transit time at a threshold of 180%. In patients with recanalization, the optimal parameter to predict the ischemic core was relative cerebral blood volume at a threshold of 66%. CONCLUSIONS: Time does not influence the optimal PCT thresholds to delineate the ischemic core and penumbra in the first 15 hours after symptom onset for relative mean transit time and relative cerebral blood volume, the optimal parameters to delineate ischemic core and penumbra.

Transplantation hépatique : introduction en Suisse d'un nouveau système d'allocation des organes [Liver transplantation: new organ allocation system in Switzerland]

This article describes the new organ allocation system for liver transplantation introduced in Switzerland on July 1, 2007. In its newly adopted transplantation law, Switzerland chose the MELD score (Model for end-stage liver disease), based on three laboratory values: total bilirubin, serum creatinine and INR. Advantages and limitations of the MELD score are discussed. Finally the West Switzerland joint liver transplantation program is briefly introduced. Cet article décrit le nouveau système d'allocation des organes pour la transplantation hépatique, qui a été introduit en Suisse depuis le 1er juillet 2007. En se dotant d'une nouvelle loi sur la transplantation en 2007, la Suisse a en effet opté pour le score MELD (Model for end-stage liver disease), c'est-à-dire un score calculable à partir de trois valeurs de laboratoire : bilirubine totale, créatinine et INR. Les avantages du MELD, mais aussi quelques inconvénients potentiels, sont brièvement décrits. Afin de clarifier le parcours du patient pour lequel une évaluation prétransplantation hépatique spécialisée est indiquée, une brève description du programme romand de transplantation hépatique est présentée.