The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.

A note on the Lorenz-maximal allocations in the imputation set

In this note we introduce the Lorenz stable set and provide an axiomatic characterization in terms of constrained egalitarianism and projection consistency. On the domain of all coalitional games, we find that this solution connects the weak constrained egalitarian solution (Dutta and Ray, 1989) with their strong counterpart (Dutta and Ray, 1991)

Corrigendum stable matchings and preferences of couples

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Scoring rules on dichotomous preferences

In this paper, we study individual incentives to report preferences truthfully for the special case when individuals have dichotomous preferences on the set of alternatives and preferences are aggregated in form of scoring rules. In particular, we show that (a) the Borda Count coincides with Approval Voting on the dichotomous preference domain, (b) the Borda Count is the only strategy-proof scoring rule on the dichotomous preference domain, and (c) if at least three individuals participate in the election, then the dichotomous preference domain is the unique maximal rich domain under which the Borda Count is strategy-proof.

Absolute type shaft encoding using LFSR

Maximal-length binary sequences have been known for a long time. They have many interesting properties, one of them is that when taken in blocks of n consecutive positions they form 2ⁿ-1 different codes in a closed circular sequence. This property can be used for measuring absolute angular positions as the circle can be divided in as many parts as different codes can be retrieved. This paper describes how can a closed binary sequence with arbitrary length be effectively designed with the minimal possible block-length, using linear feedback shift registers (LFSR). Such sequences can be used for measuring a specified exact number of angular positions, using the minimal possible number of sensors that linear methods allow.

Weighted approval voting

To allow society to treat unequal alternatives distinctly we propose a natural extension of Approval Voting by relaxing the assumption of neutrality. According to this extension, every alternative receives ex-ante a non-negative and finite weight. These weights may differ across alternatives. Given the voting decisions of every individual (individuals are allowed to vote for, or approve of, as many alternatives as they wish to), society elects all alternatives for which the product of total number of votes times exogenous weight is maximal. Our main result is an axiomatic characterization of this voting procedure.

Corrigendum: stable matchings and preferences of couples

We correct an omission in the definition of the domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Efficient and stable collective choices under gregarious preferences

We consider collective choice problems where a set of agents have to choose an alternative from a finite set and agents may or may not become users of the chosen alternative. An allocation is a pair given by the chosen alternative and the set of its users. Agents have gregarious preferences over allocations: given an allocation, they prefer that the set of users becomes larger. We require that the final allocation be efficient and stable (no agent can be forced to be a user and no agent who wants to be a user can be excluded). We propose a two-stage sequential mechanism whose unique subgame perfect equilibrium outcome is an efficient and stable allocation which also satisfies a maximal participation property.

Paper de la PAP en la resposta inflamatoria durant la pancreatitis aguda

Estudi elaborat a partir d’una estada al Institut national de la santé et de la recherche médicale, França, entre setembre i octubre del 2006. La PAP va ser identificada inicialment com una proteïna de secreció, que apareixia al suc pancreàtic després de la inducció d’una pancreatitis aguda experimental. Per la PAP s’ha suggerit diferents funcions, algunes no relacionades en aparença, però les més interessants en el camp de la pancreatitis són les activitats antiapoptótiques, mitogéniques i, especialment, antiinflamatóries. Per aprofundir en aquests aspectes de la PAP, s’ha emprat un model de ratolí PAP-/- per observar els efectes de la deleció del gen de la PAP durant la pancreatitis aguda.Per induir la pancreatitis es va fer servir el model de administració de ceruleina a dosi supra-màximes. En aquestes condicions es va observar que en els animals PAP-/-, la severitat del procés era menor. Els marcadors de necrosi pancreàtica, lipasa i amilasa, van presentar nivells menors en els animals PAP-/- que en els corresponents wild type. Per contra, el nombre de PMN infiltrats i la producció de citoquines pro-inflamatories va ser major en el pàncreas dels animals PAP-/-. La intensitat de la resposta inflamatòria observada suggereix que en condicions fisiològiques, el paper anti-inflamatori de la PAP es prou rellevant. Això ja s’havia suggerit en estudis in vitro, en els que es va demostrar que l’activitat antiinflamatòria de la PAP depenia de la via de transducció de senyal Jak/STAT/SOCS3. Aquesta hipòtesi s’ha comprovat in vivo, monitoritzant el nivell d’activació de STAT3 en els pàncreas dels animals després de la inducció de la pancreatitis.Tot plegat confirma que les funcions antiinflamatòries descrites in vitro per la PAP també es poden observar in vivo, de manera que la PAP sembla ser un agent important en la resposta de les cèl•lules pancreàtiques durant la pancreatitis aguda.

On two examples by Iyama and Yoshino

In a recent paper Iyama and Yoshino consider two interesting examples of isolated singularities over which it is possible to classify the indecomposable maximal Cohen-Macaulay modules in terms of linear algebra data. In this paper we present two new approaches to these examples. In the first approach we give a relation with cluster categories. In the second approach we use Orlov's result on the graded singularity category. We obtain some new results on the singularity category of isolated singularities which may be interesting in their own right.

Link between microstructure and properties in new metallurgical concepts for very low loss non-oriented electrical steel

The influence of chemistry and soaking temperature (maximal temperature of the continuous annealing) on the final properties of non-oriented electrical steels has been studied. With this objective two different studies have been performed. First the Mn, Ni and Cr content of a low loss electrical steel composition has been modified. An intermediate content and a high content of each element has been added in order to study the influence of this components on the magnetic looses, grain size and texture. Secondly the influence of the soaking temperature on magnetic properties, grain size and oxidation in four grades of non-oriented electrical steels (Steel A, B, C and D) was studied.

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.