On group strategy-proof mechanisms for a many-to-one matching model

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.

Constrained school choice

Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable Mechanism or the Top Trading Cycles Mechanism to assign children to public schools. There is clear evidence that for school districts that employ (variants of) the so-called Boston Mechanism the transition would lead to efficiency gains. The first two mechanisms are strategy-proof, but in practice student assignment procedures impede students to submit a preference list that contains all their acceptable schools. Therefore, any desirable property of the mechanisms is likely toget distorted. We study the non trivial preference revelation game where students can only declare up to a fixed number (quota) of schools to be acceptable. We focus on the stability of the Nash equilibrium outcomes. Our main results identify rather stringent necessary and sufficient conditions on the priorities to guaranteestability. This stands in sharp contrast with the Boston Mechanism which yields stable Nash equilibrium outcomes, independently of the quota. Hence, the transition to any of the two mechanisms is likely to come with a higher risk that students seek legal actionas lower priority students may occupy more preferred schools.

Local and global consistency properties for student placement

In the context of resource allocation on the basis of priorities, Ergin (2002) identifies a necessary and sufficient condition on the priority structure such that the student-optimal stable mechanism satisfies a consistency principle. Ergin (2002) formulates consistency as a local property based on a fixed population of agents and fixed resources -- we refer to this condition as local consistency and to his condition on the priority structure as local acyclicity. We identify a related but stronger necessary and sufficient condition (unit acyclicity) on the priority structure such that the student-optimal stable mechanism satisfies a more standard global consistency property. Next, we provide necessary and sufficient conditions for the student-optimal stable mechanism to satisfy converse consistency principles. We identify a necessary and sufficient condition (local shift-freeness) on the priority structure such that the student-optimal stable mechanism satisfies local converse consistency. Interestingly, local acyclicity implies local shift-freeness and hence the student-optimal stable mechanism more frequently satisfies local converse consistency than local consistency. Finally, in order for the student-optimal stable mechanism to be globally conversely consistent, one again has to impose unit acyclicity on the priority structure. Hence, unit acyclicity is a necessary and sufficient condition on the priority structure for the student-optimal stable mechanism to satisfy global consistency or global converse consistency.

Matching Markets under (In)complete Information

We are the first to introduce incomplete information to centralized many-to-one matching markets such as those to entry-level labor markets or college admissions. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most entry-level matching is many-to-one (and not one-to-one). We show that for stable (matching) mechanisms there is a strong and surprising link between Nash equilibria under complete information and Bayesian Nash equilibria under incomplete information. That is,given a common belief, a strategy profile is a Bayesian Nash equilibrium under incomplete information in a stable mechanism if and only if, for any true profile in the support of the common belief, the submitted profile is a Nash equilibrium under complete information at the true profile in the direct preference revelation game induced by the stable mechanism. This result may help to explain the success of stable mechanisms in these markets.

Manipulation via Capacities Revisited

This paper revisits manipulation via capacities in centralized two-sided matching markets. Sönmez (1997) showed that no stable mechanism is nonmanipulable via capacities. We show that non-manipulability via capacities can be equivalently described by two types of non-manipulation via capacities: non-Type-I-manipulability meaning that no college with vacant positions can manipulate by dropping some of its empty positions; and non-Type-II-manipulability meaning that no college with no vacant positions can manipulate by dropping some of its filled positions. Our main result shows that the student-optimal stable mechanism is the unique stable mechanism which is non-Type-I-manipulable via capacities and independent of truncations. Our characterization supports the use of the student-optimal stable mechanism in these matching markets because of its limited manipulability via capacities by colleges.

On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets

We consider two–sided many–to–many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank order lists of agents on the other side of the market. We are interested in simple preference manipulations that have been reported and studied in empirical and theoretical work: truncation strategies, which are the lists obtained by removing a tail of least preferred partners from a preference list, and the more general dropping strategies, which are the lists obtained by only removing partners from a preference list (i.e., no reshuffling). We study when truncation / dropping strategies are exhaustive for a group of agents on the same side of the market, i.e., when each match resulting from preference manipulations can be replicated or improved upon by some truncation / dropping strategies. We prove that for each stable mechanism, truncation strategies are exhaustive for each agent with quota 1 (Theorem 1). We show that this result cannot be extended neither to group manipulations (even when all quotas equal 1 – Example 1), nor to individual manipulations when the agent’s quota is larger than 1 (even when all other agents’ quotas equal 1 – Example 2). Finally, we prove that for each stable mechanism, dropping strategies are exhaustive for each group of agents on the same side of the market (Theorem 2), i.e., independently of the quotas.

A further note on the college admission game

When a stable matching rule is used for a college admission market, questions on incentives facing agents of both sides of the market naturally emerge. This note states and proves four important results which fill a gap in the theory of incentives for the college admission model. Two of them have never been demonstrated but have been used along the years and are responsible for the success that this theory has had in explaining empirical economic phenomena.

Stable secondary arrhythmias late after intraoperative radiofrequency ablation of atrial fibrillation: incidence, mechanism, and treatment.

INTRODUCTION Intraoperative radiofrequency (RF) ablation is an effective treatment of atrial fibrillation (AF). However, secondary arrhythmias late after ablation may complicate the patient's course. We report on the incidence, mechanisms, and treatment of gap-related atrial flutter and other secondary arrhythmias during long-term follow-up. METHODS AND RESULTS In 129 patients who underwent intraoperative RF ablation with placement of left atrial linear lesions using minimally invasive surgical techniques, secondary arrhythmias were analyzed during long-term follow-up (20 +/- 6 months). Transient atrial arrhythmias during the first 3 postoperative months were excluded. In 8 (6.2%) of 129 patients, sustained stable secondary arrhythmias were documented. Left atrial, gap-related atrial flutter was observed in 4 patients (3.1%). The flutter was treated by percutaneous RF ablation in 3 patients (2.3%) and with drugs in 1 patient (0.8%). In 2 patients (1.6%), right atrial isthmus-dependent atrial flutter occurred and was treated successfully by percutaneous RF ablation. In 2 patients (1.6%), ectopic right atrial tachycardias occurred and were treated with percutaneous RF ablation. CONCLUSION Late after intraoperative RF ablation of atrial fibrillation, three types of stable secondary arrhythmias were observed in 6% of patients: left atrial gap-related atrial flutter, right atrial isthmus-dependent atrial flutter, and ectopic atrial tachycardia. Gaps after intraoperative RF ablation due to noncontinuous or nontransmural linear lesions may lead to stable left atrial macroreentrant tachycardias, requiring new interventional therapy.

Sequential mechanism of solubilization and refolding of stable protein aggregates by a bichaperone network

A major activity of molecular chaperones is to prevent aggregation and refold misfolded proteins. However, when allowed to form, protein aggregates are refolded poorly by most chaperones. We show here that the sequential action of two Escherichia coli chaperone systems, ClpB and DnaK-DnaJ-GrpE, can efficiently solubilize excess amounts of protein aggregates and refold them into active proteins. Measurements of aggregate turbidity, Congo red, and 4,4′-dianilino-1,1′-binaphthyl-5,5′-disulfonic acid binding, and of the disaggregation/refolding kinetics by using a specific ClpB inhibitor, suggest a mechanism where (i) ClpB directly binds protein aggregates, ATP induces structural changes in ClpB, which (ii) increase hydrophobic exposure of the aggregates and (iii) allow DnaK-DnaJ-GrpE to bind and mediate dissociation and refolding of solubilized polypeptides into native proteins. This efficient mechanism, whereby chaperones can catalytically solubilize and refold a wide variety of large and stable protein aggregates, is a major addition to the molecular arsenal of the cell to cope with protein damage induced by stress or pathological states.

Atomistic origins of the phase transition mechanism in Ge(2)Sb(2)Te(5)

The fast and reversible phase transition mechanism between crystalline and amorphous phases of Ge(2)Sb(2)Te(5) has been in debate for several years. Through employing first-principles density functional theory calculations, we identify a direct structural link between the metastable crystalline and amorphous phases. The phase transition is driven by the displacement of Ge atoms along the rocksalt [111] direction from stable octahedron to high energy unstable tetrahedron sites close to the intrinsic vacancy regions, which generates a high energy intermediate phase between metastable and amorphous phases. Due to the instability of Ge at the tetrahedron sites, the Ge atoms naturally shift away from those sites, giving rise to the formation of local-ordered fourfold motifs and the long-range structural disorder. Intrinsic vacancies, which originate from Sb(2)Te(3), lower the energy barrier for Ge displacements, and hence, their distribution plays an important role in the phase transition. The high energy intermediate configuration can be obtained experimentally by applying an intense laser beam, which overcomes the thermodynamic barrier from the octahedron to tetrahedron sites. The high figure of merit of Ge(2)Sb(2)Te(5) is achieved from the optimal combination of intrinsic vacancies provided by Sb(2)Te(3) and the instability of the tetrahedron sites provided by GeTe.

Study of copper electrodeposition mechanism from a strike alkaline bath prepared with 1-hydroxyethane-1,1-diphosphonic acid through cyclic voltammetry technique

Copper strike baths are extensively used in metal plating industry as they present the ability to plate adherent copper layers on less-noble metal substrates such as steel and zinc die castings. However, in the last few years, due to environmental controls and safety policies for operators, the plating industry has been interested in replacing the toxic cyanide copper strike baths with environmentally friendly baths. A broad bibliographic review showed that the published papers, referring to the new nontoxic copper strike baths, are patents, having little or no emphasis focused on electrodeposition mechanisms. Therefore, it was decided to study the copper electrodeposition mechanism from a strike alkaline bath prepared with one of the most nontoxic chelating agents cited in many patents which is the 1-hydroxyethane-1,1-diphosphonic acid, known as HEDP. This acid forms very stable water soluble complexes with Cu(2+) ions, thus cupric sulfate was used for preparing the plating bath. The results obtained through a cyclic voltammetry technique showed that Cu(2+) ion reduction to Cu from an HEDP electrodeposition bath occurs via a direct reduction reaction without a formation of Cu(+) intermediates. (C) 2010 Elsevier Ltd. All rights reserved.

Dehydromonocrotaline generates sequence-selective N-7 guanine alkylation and heat and alkali stable multiple fragment DNA crosslinks

Monocrotaline is a pyrrolizidine alkaloid known to cause toxicity in humans and animals. Its mechanism of biological action is still unclear although DNA crosslinking has been suggested to a play a role in its activity. In this study we found that an active metabolite of monocrotaline, dehydromonocrotaline (DHM), alkylates guanines at the N7 position of DNA with a preference for 5'-GG and 5'-GA sequences; In addition, it generates piperidine- and heat-resistant multiple DNA crosslinks, as confirmed by electrophoresis and electron microscopy. On the basis of these findings, we propose that DHM undergoes rapid polymerization to a structure which is able to crosslink several fragments of DNA.

Site-directed mutants of RTP of Bacillus subtilis and the mechanism of replication fork arrest

DNA replication fork arrest during the termination phase of chromosome replication in Bacillus subtilis is brought about by the replication terminator protein (RTP) bound to specific DNA terminator sequences (Tev sites) distributed throughout the terminus region. An attractive suggestion by others was that crucial to the functioning of the RTP-Ter complex is a specific interaction between RTP positioned on the DNA and the helicase associated with the approaching replication fork. Ln support of this was the behaviour of two site-directed mutants of RTP. They appeared to bind Ter DNA normally but were ineffective in fork arrest as ascertained by in vitro Escherichia coli DnaB helicase and replication assays. We describe here a system for assessing the fork-arrest behaviour of RTP mutants in a bona fide in vivo assay in B. subtilis. One of the previously studied mutants, RTP.Y33N, was non-functional in fork arrest in vivo, as predicted. But through extensive analyses, this RTP mutant was shown to be severely defective in binding to Ter DNA, contrary to expectation. Taken in conjunction with recent findings on the other mutant (RTP.E30K), it is concluded that there is as yet no substantive evidence from the behaviour of RTP mutants to support the Rm-helicase interaction model for fork arrest. In an extension of the present work on RTP.Y33N, we determined the dissociation rates of complexes formed by wild-type (wt) RTP and another RTP mutant with various terminator sequences. The functional wtRTP-TerI complex was quite stable (half-life of 182 minutes), reminiscent of the great stability of the E. coli Tus-Ter complex. More significant were the exceptional stabilities of complexes comprising wtRTP and an RTP double-mutant (E39K.R42Q) bound to some particular terminator sequences. From the measurement of in vivo fork-arrest activities of the various complexes, it is concluded that the stability (half-life) of the whole RTP-Ter complex is not the overriding determinant of arrest, and that the RTP-Ter complex must be actively disrupted, or RTP removed, by the action of the approaching replication fork. (C) 1999 Academic Press.

Proteasomal degradation of N-acetyltransferase 1 is prevented by acetylation of the active site cysteine - A mechanism for the slow acetylator phenotype and substrate-dependent down-regulation

Many drugs and chemicals found in the environment are either detoxified by N-acetyltransferase 1 (NAT1, EC 2.3.1.5) and eliminated from the body or bioactivated to metabolites that have the potential to cause toxicity and/or cancer. NAT1 activity in the body is regulated by genetic polymorphisms as well as environmental factors such as substrate-dependent down-regulation and oxidative stress. Here we report the molecular mechanism for the low protein expression from mutant NAT1 alleles that gives rise to the slow acetylator phenotype and show that a similar process accounts for enzyme down-regulation by NAT1 substrates. NAT1 allozymes NAT1 14, NAT1 15, NAT1 17, and NAT1 22 are devoid of enzyme activity and have short intracellular half-lives (similar to4 h) compared with wild-type NAT1 4 and the active allozyme NAT1 24. The inactive allozymes are unable to be acetylated by cofactor, resulting in ubiquitination and rapid degradation by the 26 S proteasome. This was confirmed by site-directed mutagenesis of the active site cysteine 68. The NAT1 substrate p-aminobenzoic acid induced ubiquitination of the usually stable NAT1 4, leading to its rapid degradation. From this study, we conclude that NAT1 exists in the cell in either a stable acetylated state or an unstable non-acetylated state and that mutations in the NAT1 gene that prevent protein acetylation produce a slow acetylator phenotype.

The stability of the equilibrium outcomes in the admission games induced by stable matching rules

A stable matching rule is used as the outcome function for the Admission game where colleges behave straightforwardly and the students` strategies are given by their preferences over the colleges. We show that the college-optimal stable matching rule implements the set of stable matchings via the Nash equilibrium (NE) concept. For any other stable matching rule the strategic behavior of the students may lead to outcomes that are not stable under the true preferences. We then introduce uncertainty about the matching selected and prove that the natural solution concept is that of NE in the strong sense. A general result shows that the random stable matching rule, as well as any stable matching rule, implements the set of stable matchings via NE in the strong sense. Precise answers are given to the strategic questions raised.