Welfare Maximizing Contest Success Functions when the Planner Cannot Commit

We analyze how a contest organizer chooses optimally the winner when the contestants' efforts are already exerted and commitment to the use of a given contest success function is not possible. We de…ne the notion of rationalizability in mixed-strategies to capture such a situation. Our approach allows to derive different contest success functions depending on the aims and attitudes of the decider. We derive contest success functions which are closely related to commonly used functions providing new support for them. By taking into account social welfare considerations our approach bridges the contest literature and the recent literature on political economy. Keywords: Endogenous Contests, Contest Success Function, Mixed-Strategies. JEL Classi…cation: C72 (Noncooperative Games), D72 (Economic Models of Political Processes: Rent-Seeking, Elections), D74 (Conflict; Conflict Resolution; Alliances)

Linear Aggregation In The Social Accounting Matrix Framework

In economic literature, information deficiencies and computational complexities have traditionally been solved through the aggregation of agents and institutions. In inputoutput modelling, researchers have been interested in the aggregation problem since the beginning of 1950s. Extending the conventional input-output aggregation approach to the social accounting matrix (SAM) models may help to identify the effects caused by the information problems and data deficiencies that usually appear in the SAM framework. This paper develops the theory of aggregation and applies it to the social accounting matrix model of multipliers. First, we define the concept of linear aggregation in a SAM database context. Second, we define the aggregated partitioned matrices of multipliers which are characteristic of the SAM approach. Third, we extend the analysis to other related concepts, such as aggregation bias and consistency in aggregation. Finally, we provide an illustrative example that shows the effects of aggregating a social accounting matrix model.

Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges consist of two alternatives, in terms of two types of basic properties.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Relaxation methods for solving linear inequality systems: Converging results

The problem of finding a feasible solution to a linear inequality system arises in numerous contexts. In [12] an algorithm, called extended relaxation method, that solves the feasibility problem, has been proposed by the authors. Convergence of the algorithm has been proven. In this paper, we onsider a class of extended relaxation methods depending on a parameter and prove their convergence. Numerical experiments have been provided, as well.

Divergent functions of three Candida albicans zinc-cluster transcription factors (CTA4, ASG1 and CTF1) complementing pleiotropic drug resistance in Saccharomyces cerevisiae.

One of the mediators of pleiotropic drug resistance in Saccharomyces cerevisiae is the ABC-transporter gene PDR5. This gene is regulated by at least two transcription factors with Zn(2)-Cys(6) finger DNA-binding motifs, Pdr1p and Pdr3p. In this work, we searched for functional homologues of these transcription factors in Candida albicans. A C. albicans gene library was screened in a S. cerevisiae mutant lacking PDR1 and PDR3 and clones resistant to azole antifungals were isolated. From these clones, three genes responsible for azole resistance were identified. These genes (CTA4, ASG1 and CTF1) encode proteins with Zn(2)-Cys(6)-type zinc finger motifs in their N-terminal domains. The C. albicans genes expressed in S. cerevisiae could activate the transcription of a PDR5-lacZ reporter system and this reporter activity was PDRE-dependent. They could also confer resistance to azoles in a S. cerevisiae strain lacking PDR1, PDR3 and PDR5, suggesting that CTA4-, ASG1- and CTF1-dependent azole resistance can be caused by genes other than PDR5 in S. cerevisiae. Deletion of CTA4, ASG1 and CTF1 in C. albicans had no effect on fluconazole susceptibility and did not alter the expression of the ABC-transporter genes CDR1 and CDR2 or the major facilitator gene MDR1, which encode multidrug transporters known as mediators of azole resistance in C. albicans. However, additional phenotypic screening tests on the C. albicans mutants revealed that the presence of ASG1 was necessary to sustain growth on non-fermentative carbon sources (sodium acetate, acetic acid, ethanol). In conclusion, C. albicans possesses functional homologues of the S. cerevisiae Pdr1p and Pdr3p transcription factors; however, their properties in C. albicans have been rewired to other functions.

Green vs. Lempert functions: a minimal example

The Lempert function for a set of poles in a domain of Cn at a point z is obtained by taking a certain infimum over all analytic disks going through the poles and the point z, and majorizes the corresponding multi-pole pluricomplex Green function. Coman proved that both coincide in the case of sets of two poles in the unit ball. We give an example of a set of three poles in the unit ball where this equality fails.

On the system of the functions x (s) / (s-r)k

"Vegeu el resum a l'inici del document del fitxer adjunt."

Effects of a dual inhibitor of angiotensin converting enzyme and neutral endopeptidase, MDL 100,240, on endocrine and renal functions in healthy volunteers.

OBJECTIVE: To investigate the endocrine and renal effects of the dual inhibitor of angiotensin converting enzyme and neutral endopeptidase, MDL 100,240. DESIGN: A randomized, placebo-controlled, crossover study was performed in 12 healthy volunteers. METHODS: MDL 100,240 was administered intravenously over 20 min at single doses of 6.25 and 25 mg in subjects with a sodium intake of 280 (n = 6) or 80 (n = 6) mmol/day. Measurements were taken of supine and standing blood pressure, plasma angiotensin converting enzyme activity, angiotensin II, atrial natriuretic peptide, urinary atrial natriuretic peptide and cyclic GMP excretion, effective renal plasma flow and the glomerular filtration rate as p-aminohippurate and inulin clearances, electrolytes and segmental tubular function by endogenous lithium clearance. RESULTS: Supine systolic blood pressure was consistently decreased by MDL 100,240, particularly after the high dose and during the low-salt intake. Diastolic blood pressure and heart rate did not change. Plasma angiotensin converting enzyme activity decreased rapidly and dose-dependently. In both the high- and the low-salt treatment groups, plasma angiotensin II levels fell and renin activity rose accordingly, while plasma atrial natriuretic peptide levels remained unchanged. In contrast, urinary atrial natriuretic peptide excretion increased dose-dependently under both diets, as did urinary cyclic GMP excretion. Effective renal plasma flow and the glomerular filtration rate did not change. The urinary flow rate increased markedly during the first 2 h following administration of either dose of MDL 100,240 (P < 0.001) and, similarly, sodium excretion tended to increase from 0 to 4 h after the dose (P = 0.07). Potassium excretion remained stable. Proximal and distal fractional sodium reabsorption were not significantly altered by the treatment. Uric acid excretion was increased. The safety and clinical tolerance of MDL 100,240 were good. CONCLUSIONS: The increased fall in blood pressure in normal volunteers together with the preservation of renal hemodynamics and the increased urinary volume, atrial natriuretic peptide and cyclic GMP excretion distinguish MDL 100,240 as a double-enzyme inhibitor from inhibitors of the angiotensin converting enzyme alone. The differences appear to be due, at least in part, to increased renal exposure to atrial natriuretic peptide following neutral endopeptidase blockade.

Public Health Functions Project Team Minutes (PDF 21 KB)

Minutes of the Meeting of the Public Health Functions Project Team 21 February 2006

A subspace correction method for discontinuous Galerkin discretizations of linear elasticity equations

We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lamé parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed preconditioners and include numerical examples that validate the theory and assess the performance of the preconditioners.