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.

Optable : The operation table serious game

Aquest treball consisteix en la realització d'un estudi al voltant dels anomenats serious games, jocs destinats a l'aprenentatge. Concretament, el projecte es centra en els serious games d'àmbit sanitari. A més d'un estudi de l'art, el treball consta del desenvolupament d'un serious game anomenat Optable per a la pràctica de la preparació del material quirúrgic d'una taula d'operacions. Aquesta aplicació ha estat desenvolupada sota llicència GNU GPL.

Diseño e implementación de un serious game para el aprendizaje del material quirúrgico y desarrollo de una operación

En este trabajo se recoge información útil que se debe tener en cuenta para desarrollar un serious game pertinente para el entrenamiento de profesionales de la salud, que aporte destrezas y habilidades necesarias para afrontar las cirugías reales. Se propone un serious game a modo de simulador de diferentes operaciones quirúrgicas traumatológicas, que permite al usuario las etapas preoperatorias, intraoperatorias y postoperatorias de una cirugía, en las que se debe describir qué acciones se llevan a cabo, quiénes la realizan y si es necesario algún material específico.

Cercador corporatiu de contactes

Desenvolupament d'un cercador telefònic pels empleats d'una empresa de més de 3000 treballadors.

Control domèstic visual per a Android

El projecte desenvolupa una aplicació visual per a dispositius mòbils basada en PhoneGap - Cordova (HTML + CSS + JavaScript) per al control del dispositiu ODControl de l'empresa OpenDomo Services.

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.

El joc del TERCETI : una unitat didàctica multimèdia sobre GNU/LINUX amb suport DVB-MHP i SCORM.

Fent ús del programari lliure s'ha generat la unitat didàctica del joc del terceti per a la televisió digital interactiva i s'ha desada en format SCORM. La facilitat d'ús del comandament a distància fa possible practicar un tipus de t-learning fonamentat en l'edutainment (education+entertaiment) i provoca que el teleespectador passiu passi a ser un "teleusuari" més actiu.

Generación de metadatos semánticos mediante juegos on-line

Actualmente se pretende que los ordenadores puedan entender la semántica de la información que hay en la Web y que sea posible integrar diversas fuentes de información independientemente de la procedencia y formato de éstas, haciendo así una Web Semántica. Uno de los mayores problemas que tiene la Web Semántica es la falta de contenidos semánticos, principalmente debido a la falta de métodos de anotación automáticos existentes. Una forma de resolver este problema se basa en esconder tras aplicaciones que la gente usa diariamente, como los juegos on-line, estos procesos de generación de metadatos semánticos. El objetivo de este proyecto es estudiar diferentes iniciativas que tratan de enmascarar la generación de metadatos semánticos a través de los juegos on-line y el desarrollo de un prototipo de casual game para anotar semánticamente recursos. Se trata de un juego sencillo de pregunta-respuesta, donde dos usuarios concurrentes contestan a preguntas preestablecidas y definidas dentro de una ontología de dominio, obteniendo puntos en aquellas preguntas donde hayan dado la misma respuesta.