Coalition formation in a contest game with three heterogeneous players

We analyze the incentives for cooperation of three players differing in their efficiency of effort in a contest game. We concentrate on the non-cooperative bargaining foundation of coalition formation, and therefore, we adopt a two-stage model. In the first stage, individuals form coalitions following a bargaining protocol similar to the one proposed by Gul (1989). Afterwards, coalitions play the contest game of Esteban and Ray (1999) within the resulting coalition structure of the first stage. We find that the grand coalition forms whenever the distribution of the bargaining power in the coalition formation game is equal to the distribution of the relative efficiency of effort. Finally, we use the case of equal bargaining power for all individuals to show that other types of coalition structures may be observed as well.

A generalized assignment game

The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of both pairwise and group stable outcomes is proved. We study the structure of the group stable set and we finally prove that the set of group stable payoffs forms a complete lattice with one optimal group stable payoff for each side of the market.

Does affirmative action reduce effort incentives? A contest game analysis

In this paper a contest game with heterogeneous players is analyzed in which heterogeneity could be the consequence of past discrimination. Based on the normative perception of the heterogeneity there are two policy options to tackle this heterogeneity: either it is ignored and the contestants are treated equally, or affirmative action is implemented which compensates discriminated players. The consequences of these two policy options are analyzed for a simple two-person contest game and it is shown that the frequently criticized trade-off between affirmative action and total effort does not exist: Instead, affirmative action fosters effort incentives. A generalization to the n-person case and to a case with a partially informed contest designer yields the same result if the participation level is similar under each policy.

Inter-group conflict and intra-group punishment in an experimental contest game

We study how conflict in a contest game is influenced by rival parties being groups and by group members being able to punish each other. Our main motivation stems from the analysis of socio-political conflict. The relevant theoretical prediction in our setting is that conflict expenditures are independent of group size and independent of whether punishment is available or not. We find, first, that our results contradict the independence of group-size prediction: conflict expenditures of groups are substantially larger than those of individuals, and both are substantially above equilibrium. Towards the end of the experiment material losses in groups are 257% of the predicted level. There is, however, substantial heterogeneity in the investment behaviour of individual group members. Second, allowing group members to punish each other after individual contributions to the contest effort are revealed leads to even larger conflict expenditures. Now material losses are 869% of the equilibrium level and there is much less heterogeneity in individual group members' investments. These results contrast strongly with those from public goods experiments where punishment enhances efficiency and leads to higher material payoffs.

Dynamic stackelberg game with risk-averse players: optimal risk-sharing under asymmetric information

The objective of this paper is to clarify the interactive nature of the leader-follower relationship when both players are endogenously risk-averse. The analysis is placed in the context of a dynamic closed-loop Stackelberg game with private information. The case of a risk-neutral leader, very often discussed in the literature, is only a borderline possibility in the present study. Each player in the game is characterized by a risk-averse type which is unknown to his opponent. The goal of the leader is to implement an optimal incentive compatible risk-sharing contract. The proposed approach provides a qualitative analysis of adaptive risk behavior profiles for asymmetrically informed players in the context of dynamic strategic interactions modelled as incentive Stackelberg games.

The Multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria

A multiple-partners assignment game with heterogeneous sales and multiunit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents' utilities that are attainable at equilibrium.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.

Open Chess Game Analyzer

Aquest document detalla la feina que s'ha dut a terme per desenvolupar el projecte Open Chess Game Analyzer. La finalitat del mateix és desenvolupar un aplicatiu lliure que sigui capaç d'analitzar partides d'escacs a partir d'un fitxer PGN.

Serious game de código abierto para la educación y entrenamiento en el procedimiento de artroscopia de rodilla

En esta memoria se describe el diseño a nivel conceptual de un serious game con el objetivo de ofrecer soluciones para la mejora del aprendizaje y adquisición de aptitudes y habilidades de los residentes-profesionales en las técnicas de artroscopia de rodilla, con el objetivo de comprobar la hipótesis de que los modelos de aprendizaje basados en videojuegos pueden servir de puente entre el cuerpo teórico de la especialidad y el ejercicio práctico, reduciendo los riesgos de las primeras intervenciones y acelerando la formación de los especialistas, en otras palabras, difuminando el umbral entre teoría y práctica y reduciendo los costos derivados del ejercicio práctico (económicos y temporales) y a su vez, paliando las necesidades formativas de estas.

Mathematical modeling and analysis of the interaction of populations of bacteria and bacteriophages within chicken intestine

Vegeu el resum a l'inici del document de l'arxiu adjunt

Proposal for the analysis of a video game, a film, and their relationship : Silent Hill as a subject of the horror genre

Aquest treball de recerca fa un estudi comparatiu del videojoc de terror amb el seu homòleg cinematogràfic. L’objectiu és arribar a saber si els dos mitjans de comunicació usen les mateixes tècniques per transmetre les seves històries i per crear suspens. Aquesta investigació és només una part d'un estudi més ampli amb el que es pretén tenir un coneixement més aprofundit de les emocions de la gent i les reaccions que els provoca un videojoc de terror en comparació amb la visualització de l'adaptació cinematogràfica del corresponent videojoc.

The Lottery Blotto Game

In this paper we relax the Colonel Blotto game assumption that for a given battle the player who allocates the higher measure of resources wins that battle. We assume that for a given battle, the Colonel who allocates the higher measure of resources is more likely to win that battle. We have a simpler model for which we are able to compute all Nash equilibria in pure strategies for any valuations pro le that players might have. Something that is not possible for the original Blotto game. JEL: C72, D74, H56. KEYWORDS: Colonel Blotto game; lottery contest function.

Comparison of splice sites in mammals and chicken

We have carried out an initial analysis of the dynamics of the recent evolution of the splice-sites sequences on a large collection of human, rodent (mouse and rat), and chicken introns. Our results indicate that the sequences of splice sites are largely homogeneous within tetrapoda. We have also found that orthologous splice signals between human and rodents and within rodents are more conserved than unrelated splice sites, but the additional conservation can be explained mostly by background intron conservation. In contrast, additional conservation over background is detectable in orthologous mammalian and chicken splice sites. Our results also indicate that the U2 and U12 intron classes seem to have evolved independently since the split of mammals and birds; we have not been able to find a convincing case of interconversion between these two classes in our collections of orthologous introns. Similarly, we have not found a single case of switching between AT-AC and GT-AG subtypes within U12 introns, suggesting that this event has been a rare occurrence in recent evolutionary times. Switching between GT-AG and the noncanonical GC-AG U2 subtypes, on the contrary, does not appear to be unusual; in particular, T to C mutations appear to be relatively well tolerated in GT-AG introns with very strong donor sites.

Comparative gene finding in chicken indicates that we are closing in on the set of multi-exonic widely-expressed human genes

The recent availability of the chicken genome sequence poses the question of whether there are human protein-coding genes conserved in chicken that are currently not included in the human gene catalog. Here, we show, using comparative gene finding followed by experimental verification of exon pairs by RT–PCR, that the addition to the multi-exonic subset of this catalog could be as little as 0.2%, suggesting that we may be closing in on the human gene set. Our protocol, however, has two shortcomings: (i) the bioinformatic screening of the predicted genes, applied to filter out false positives, cannot handle intronless genes; and (ii) the experimental verification could fail to identify expression at a specific developmental time. This highlights the importance of developing methods that could provide a reliable estimate of the number of these two types of genes.

Gene finding in the chicken genome

Background: Despite the continuous production of genome sequence for a number of organisms,reliable, comprehensive, and cost effective gene prediction remains problematic. This is particularlytrue for genomes for which there is not a large collection of known gene sequences, such as therecently published chicken genome. We used the chicken sequence to test comparative andhomology-based gene-finding methods followed by experimental validation as an effective genomeannotation method.Results: We performed experimental evaluation by RT-PCR of three different computational genefinders, Ensembl, SGP2 and TWINSCAN, applied to the chicken genome. A Venn diagram wascomputed and each component of it was evaluated. The results showed that de novo comparativemethods can identify up to about 700 chicken genes with no previous evidence of expression, andcan correctly extend about 40% of homology-based predictions at the 5' end.Conclusions: De novo comparative gene prediction followed by experimental verification iseffective at enhancing the annotation of the newly sequenced genomes provided by standardhomology-based methods.