Two new game birds from Peru.

v.39:no.32(1959)

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.

Markup Test Reader: eina de creació i lectura de formularis de test

El projecte exposat en aquestes pàgines és un document d'estudi, anàlisi, disseny, programació i procés de proves en la confecció d'una aplicació de creació i lectura de formularis de test. Aquesta aplicació parteix de les possibilitats de millora de les prestacions, usabilitat i escalabilitat que poden oferir les tècniques de visió en computador en aquest camp. El projecte s'ha basat en un exemple en concret per tal d'oferir una eina vàlida per a la automatització de les tasques que en una empresa de recursos humans es poden donar a l'hora de gestionar la informació dels test psicotècnics que necessiten gestionar. El projecte parteix d'unes premisses bàsiques tals com: l'ús de tècniques en visió per computador, la modularitat, el compliment d'estàndards, la facilitat d'ús i la facilitat en la gestió de canvis.

Caracterización de juegos basados en agentes móviles: diseño e implementación de un caso práctico y su incorporación en el programa docente de una asignatura de redes de computadores

En aquest projecte s'han classificat i posteriorment caracteritzat els jocs on la tecnologia d'agents mòbils és més òptima. Posteriorment s'ha dissenyat un core per al desenvolupament de jocs d'aquesta tipologia. Mitjançant aquest core s'han implementat el joc del Parchís i el joc del Nim. Aquest últim cas pràctic ha estat realitzat per a l'elaboració d'una pràctica per a l'assignatura de Xarxes de Computadors II. Gràcies als avantatges que ens oferix la tecnologia d'agents mòbils, com la tolerància a fallades i flexibilitat, hem demostrat amb aquest projecte que és òptim utilitzar aquesta tecnologia per a la implementació de jocs.

Sistema de Informació i Gestió Integral de la Producció Pesquera Internacional (SIGIPPI)

Des de la ciència geogràfica combinada amb el coneixement biològic i comercial, aquest projecte pretén crear una eina basada en la biogeografia i les últimes tecnologies de la Informació Geogràfica, que permetrà a l’usuari disposar de informació actualitzada per cada espècie amb interès comercial. El projecte es basa en el desenvolupament d’una aplicació web de consulta, entrada i actualització de dades referents a la producció pesquera internacional. Les eines utilitzades són les bases de dades MySQL i PostgreSQL i programació web amb html, php i javacript. Aquesta aplicació està pensada per ser accessible des de qualsevol ordinador amb connexió a internet i es subdivideix en tres sub-aplicacions. La primera sub-aplicació es basa en l’entrada d’espècies a partir de l’estructura taxonòmica. Partint de l’arbre taxonòmic, l’usuari té la possibilitat d’entrar, eliminar o modificar qualsevol tàxon o espècie. La segona subaplicació és una eina de digitalització cartogràfica on-line on l’usuari podrà marcar, eliminar o modificar sobre un mapa les localitzacions de les espècies que estiguin entrades en la sub-aplicació anterior. Finalment, la tercera sub-aplicació és una eina d’entrada de dades quinzenals referent als comportaments pel que fa tan a les dimensions com a les disponibilitats de pesca per cada espècie i localització.

Results of computer assisted navigation in Total Knee Arthroplasty (TKA): comparison with the conventional method

The aim of this retrospective study was to compare the clinical and radiographic results after TKA (PFC, DePuy), performed either by computer assisted navigation (CAS, Brainlab, Johnson&Johnson) or by conventional means. Material and methods: Between May and December 2006 we reviewed 36 conventional TKA performed between 2002 and 2003 (group A) and 37 navigated TKA performed between 2005 and 2006 (group B) by the same experienced surgeon. The mean age in group A was 74 years (range 62-90) and 73 (range 58-85) in group B with a similar age distribution. The preoperative mechanical axes in group A ranged from -13° varus to +13° valgus (mean absolute deviation 6.83°, SD 3.86), in group B from -13° to +16° (mean absolute deviation 5.35, SD 4.29). Patients with a previous tibial osteotomy or revision arthroplasty were excluded from the study. Examination was done by an experienced orthopedic resident independent of the surgeon. All patients had pre- and postoperative long standing radiographs. The IKSS and the WOMAC were utilized to determine the clinical outcome. Patient's degree of satisfaction was assessed on a visual analogous scale (VAS). Results: 32 of the 37 navigated TKAs (86,5%) showed a postoperative mechanical axis within the limits of 3 degrees of valgus or varus deviation compared to only 24 (66%) of the 36 standard TKAs. This difference was significant (p = 0.045). The mean absolute deviation from neutral axis was 3.00° (range -5° to +9°, SD: 1.75) in group A in comparison to 1.54° (range -5° to +4°, SD: 1.41) in group B with a highly significant difference (p = 0.000). Furthermore, both groups showed a significant postoperative improvement of their mean IKSS-values (group A: 89 preoperative to 169 postoperative, group B 88 to 176) without a significant difference between the two groups. Neither the WOMAC nor the patient's degree of satisfaction - as assessed by VAS - showed significant differences. Operation time was significantly higher in group B (mean 119.9 min.) than in group A (mean 99.6 min., p <0.000). Conclusion: Our study showed consistent significant improvement of postoperative frontal alignment in TKA by computer assisted navigation (CAS) compared to standard methods, even in the hands of a surgeon well experienced in standard TKA implantation. However, the follow-up time of this study was not long enough to judge differences in clinical outcome. Thus, the relevance of computer navigation for clinical outcome and survival of TKA remains to be proved in long term studies to justify the longer operation time. References 1 Stulberg SD. Clin Orth Rel Res. 2003;(416):177-84. 2 Chauhan SK. JBJS Br. 2004;86(3):372-7. 3 Bäthis H, et al. Orthopäde. 2006;35(10):1056-65.

Distal dendrites of frog motor neurons: a computer-aided electron microscopic study of cobalt-filled cells.

With the aid of the cobalt labelling technique, frog spinal cord motor neuron dendrites of the subpial dendritic plexus have been identified in serial electron micrographs. Computer reconstructions of various lengths (2.5-9.8 micron) of dendritic segments showed the contours of these dendrites to be highly irregular, and to present many thorn-like projections 0.4-1.8 micron long. Number, size and distribution of synaptic contacts were also determined. Almost half of the synapses occurred at the origins of the thorns and these synapses had the largest contact areas. Only 8 out of 54 synapses analysed were found on thorns and these were the smallest. For the total length of reconstructed dendrites there was, on average, one synapse per 1.2 micron, while 4.4% of the total dendritic surface was covered with synaptic contacts. The functional significance of these distal dendrites and their capacity to influence the soma membrane potential is discussed.

Benchmarking therapeutic drug monitoring software: A review of available computer tools

Therapeutic drug monitoring (TDM) aims to optimize treatments by individualizing dosage regimens based on the measurement of blood concentrations. Dosage individualization to maintain concentrations within a target range requires pharmacokinetic and clinical capabilities. Bayesian calculations currently represent the gold standard TDM approach but require computation assistance. In recent decades computer programs have been developed to assist clinicians in this assignment. The aim of this survey was to assess and compare computer tools designed to support TDM clinical activities. The literature and the Internet were searched to identify software. All programs were tested on personal computers. Each program was scored against a standardized grid covering pharmacokinetic relevance, user friendliness, computing aspects, interfacing and storage. A weighting factor was applied to each criterion of the grid to account for its relative importance. To assess the robustness of the software, six representative clinical vignettes were processed through each of them. Altogether, 12 software tools were identified, tested and ranked, representing a comprehensive review of the available software. Numbers of drugs handled by the software vary widely (from two to 180), and eight programs offer users the possibility of adding new drug models based on population pharmacokinetic analyses. Bayesian computation to predict dosage adaptation from blood concentration (a posteriori adjustment) is performed by ten tools, while nine are also able to propose a priori dosage regimens, based only on individual patient covariates such as age, sex and bodyweight. Among those applying Bayesian calculation, MM-USC*PACK© uses the non-parametric approach. The top two programs emerging from this benchmark were MwPharm© and TCIWorks. Most other programs evaluated had good potential while being less sophisticated or less user friendly. Programs vary in complexity and might not fit all healthcare settings. Each software tool must therefore be regarded with respect to the individual needs of hospitals or clinicians. Programs should be easy and fast for routine activities, including for non-experienced users. Computer-assisted TDM is gaining growing interest and should further improve, especially in terms of information system interfacing, user friendliness, data storage capability and report generation.

Robot educatiu per un PBL en enginyeria informàtica

En aquest projecte s’ha estudiat el disseny d’una plataforma robòtica mòbil per un PBL (Aprenentatge Basat en Problemes) en enginyeria informàtica. El principal objectiu és introduir aquest model en l’ensenyament universitari, com a complement de diferents assignatures de primer curs. Per arribar a aconseguir aquests objectius, s’ha dissenyat i construït una plataforma robòtica, dirigida per un microcontrolador i dotada de diversos sensors per interactuar amb l’entorn. El robot permet diferents tipus de programació i esta especialment dissenyada per ser una bona experiència educativa.

Affirmative Action Policy and Effort Levels. Sequential-Move Contest Game Argument

In this paper we analyse a simple two-person sequential-move contest game with heterogeneous players. Assuming that the heterogeneity could be the consequence of past discrimination, we study the effects of implementation of affirmative action policy, which tackles this heterogeneity by compensating discriminated players, and compare them with the situation in which the heterogeneity is ignored and the contestants are treated equally. In our analysis we consider different orders of moves. We show that the order of moves of contestants is a very important factor in determination of the effects of the implementation of the affirmative action policy. We also prove that in such cases a significant role is played by the level of the heterogeneity of individuals. In particular, in contrast to the present-in-the-literature predictions, we demonstrate that as a consequence of the interplay of these two factors, the response to the implementation of the affirmative action policy option may be the decrease in the total equilibrium effort level of the contestants in comparison to the unbiased contest game.

How private is private information? The ability to spot deception in an economic game

We provide experimental evidence on the ability to detect deceit in a buyer-seller game with asymmetric information. Sellers have private information about the buyer's valuation of a good and sometimes have incentives to mislead buyers. We examine if buyers can spot deception in face-to-face encounters. We vary (1) whether or not the buyer can interrogate the seller, and (2) the contextual richness of the situation. We find that the buyers' prediction accuracy is above chance levels, and that interrogation and contextual richness are important factors determining the accuracy. These results show that there are circumstances in which part of the information asymmetry is eliminated by people's ability to spot deception.

Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach

In the line opened by Kalai and Muller (1997), we explore new conditions on prefernce domains which make it possible to avoid Arrow's impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In the proof, we use integer programming tools, following an approach first applied to social choice theory by Sethuraman, Teo and Vohra ((2003), (2006)). In order to obtain a representation of Arrovian social welfare functions whose range can include indifference, we generalize Sethuraman et al.'s work and specify integer programs in which variables are allowed to assume values in the set {0, 1/2, 1}: indeed, we show that, there exists a one-to-one correspondence between solutions of an integer program defined on this set and the set of all Arrovian social welfare functions - without restrictions on the range.