Existence, Uniqueness and Some Comparative Statics for Ratio- and Lindahl Equilibria: New Wine in Old Bottles

We present a rigorous, yet elementary, demonstration of the existence of a unique Lindahl equilibrium under the assumptions that characterize the standard n-player public good model. Indeed, our approach, which exploits the aggregative structure of the public good model, lends itself to a transparent geometric representation. Moreover, it can handle the more general concept of the cost-share or ratio equilibrium. Finally, we indicate how it may be ex-ploited to facilitate comparative static analysis of Lindahl and cost share equilibria.public goods, Lindahl equilibrium, ratio equilibrium

EXISTENCE, UNIQUENESS AND SOME COMPARATIVE STATICS FOR RATIO- AND LINDAHL EQUILIBRIA: NEW WINE IN OLD BOTTLES

We present a rigorous, yet elementary, demonstration of the existence of a unique Lindahl equilibrium under the assumptions that characterize the standard n-player public good model. Indeed, our approach, which exploits the aggregative structure of the public good model, lends itself to a transparent geometric representation. Moreover, it can handle the more general concept of the cost-share or ratio equilibrium. Finally, we indicate how it may be ex-ploited to facilitate comparative static analysis of Lindahl and cost share equilibria.Public goods, Lindahl equilibrium, ratio equilibrium.

Matching as a Cure for Underprovision of Voluntary Public Good Supply: Analysis and an Example

Matching mechanisms are regarded as an important instrument to bring about Pareto optimal allocations in a public good economy and to cure the underprovision problem associated with private provision of public goods. The desired Pareto optimal interior matching equilibrium, however, emerges only under very special conditions. But we show in this note that corner solutions, in which some agents choose zero flat contributions, normally avoid underprovision and illustrate and interpret our results by a simple numerical example.public goods, matching, Pareto optimality

Matching as a Cure for Underprovision of Voluntary Public Good Supply: Analysis and an Example

Matching mechanisms are regarded as an important instrument to bring about Pareto optimal allocations in a public good economy and to cure the underprovision problem associated with private provision of public goods. The desired Pareto optimal interior match-ing equilibrium, however, emerges only under very special conditions. But we show in this note that corner solutions, in which some agents choose zero flat contributions, normally avoid underprovision and illustrate and interpret our results by a simple numerical example.

Standing Liberty and Other Stories

This miscellany represents the pick of the vignettes, tales, and anecdotes the author has gathered and spun out over the past few years. Personal experience, with the exception of a few inessential details, is not represented. The influence of ragtime music, which played with relentless syncopation in the author\u27s head as he composed with pencil and yellow pad, may be discernable to those who take the trouble to read the sentences aloud

Existence and Warr Neutrality for Matching Equilibria in a Public Good Economy: An Aggregative Game Approach

Using the aggregative game approach as developed by Cornes and Hartley (2003, 2007) this paper analyzes the conditions under which matching mechanisms in a public good economy lead to interior matching equilibria in which all agents make strictly positive flat contributions to the public good. In particular we show that the distribution of income among the agents is a crucial determinant for the existence of interior matching equilibria. In addition, we explore which matching mechanisms show Warr neutrality and how the size of the economy affects the possibility of implementing a certain type of Pareto optimal solutions through matching.

The new radiation-hard optical links for the ATLAS pixel detector

The ATLAS detector is currently being upgraded with a new layer of pixel based charged particle tracking and a new arrangement of the services for the pixel detector. These upgrades require the replacement of the opto-boards previously used by the pixel detector. In this report we give details on the design and production of the new opto-boards.Comment: Presentation at the DPF 2013 Meeting of the American Physical Society Division of Particles and Fields, Santa Cruz, California, August 13-17, 201

Closed-form sums for some perturbation series involving associated Laguerre polynomials

Infinite series sum_{n=1}^infty {(alpha/2)_n / (n n!)}_1F_1(-n, gamma, x^2), where_1F_1(-n, gamma, x^2)={n!_(gamma)_n}L_n^(gamma-1)(x^2), appear in the first-order perturbation correction for the wavefunction of the generalized spiked harmonic oscillator Hamiltonian H = -d^2/dx^2 + B x^2 + A/x^2 + lambda/x^alpha 0 0, A >= 0. It is proved that the series is convergent for all x > 0 and 2 gamma > alpha, where gamma = 1 + (1/2)sqrt(1+4A). Closed-form sums are presented for these series for the cases alpha = 2, 4, and 6. A general formula for finding the sum for alpha/2 = 2 + m, m = 0,1,2, ..., in terms of associated Laguerre polynomials, is also provided.Comment: 16 page

Selection of functional human antibodies from retroviral display libraries

Antibody library technology represents a powerful tool for the discovery and design of antibodies with high affinity and specificity for their targets. To extend the technique to the expression and selection of antibody libraries in an eukaryotic environment, we provide here a proof of concept that retroviruses can be engineered for the display and selection of variable single-chain fragment (scFv) libraries. A retroviral library displaying the repertoire obtained after a single round of selection of a human synthetic scFv phage display library on laminin was generated. For selection, antigen-bound virus was efficiently recovered by an overlay with cells permissive for infection. This approach allowed more than 10(3)-fold enrichment of antigen binders in a single selection cycle. After three selection cycles, several scFvs were recovered showing similar laminin-binding activities but improved expression levels in mammalian cells as compared with a laminin-specific scFv selected by the conventional phage display approach. Thus, translational problems that occur when phage-selected antibodies have to be transferred onto mammalian expression systems to exert their therapeutic potential can be avoided by the use of retroviral display libraries

A fluid analysis framework for a Markovian process algebra

Markovian process algebras, such as PEPA and stochastic π-calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models generated by process algebras, as with other interleaving formalisms, are susceptible to the state space explosion problem. Models with only a modest number of process algebra terms can easily generate so many states that they are all but intractable to traditional solution techniques. Previous work aimed at addressing this problem has presented a fluid-flow approximation allowing the analysis of systems which would otherwise be inaccessible. To achieve this, systems of ordinary differential equations describing the fluid flow of the stochastic process algebra model are generated informally. In this paper, we show formally that for a large class of models, this fluid-flow analysis can be directly derived from the stochastic process algebra model as an approximation to the mean number of component types within the model. The nature of the fluid approximation is derived and characterised by direct comparison with the Chapman–Kolmogorov equations underlying the Markov model. Furthermore, we compare the fluid approximation with the exact solution using stochastic simulation and we are able to demonstrate that it is a very accurate approximation in many cases. For the first time, we also show how to extend these techniques naturally to generate systems of differential equations approximating higher order moments of model component counts. These are important performance characteristics for estimating, for instance, the variance of the component counts. This is very necessary if we are to understand how precise the fluid-flow calculation is, in a given modelling situation