On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

An axiomatization of the nucleolus of the assignment game

[cat] En el domini dels jocs bilaterals d’assignació, es presenta una axiomàtica del nucleolus com l´unica solució que compleix les propietats de consistència respecte del joc derivat definit per Owen (1992) i monotonia de les queixes dels sectors respecte de la seva cardinalitat. Com a conseqüència obtenim una caracterització geomètrica del nucleolus mitjançant una propietat de bisecció més forta que la que satisfan els punts del kernel (Maschler et al, 1979).

Observational methodology in football: Development of an instrument to study the offensiva game in football.

The following paper introduces a new approach to the analysis of offensive game in football. Therefore, the main aim of this study was to create an instrument for collecting information for the analysis of offensive action and interactions game. The observation instrument that was used to accomplish the main objective of this work consists of a combination of format fields (FC) and systems of categories (SC). This methodology is a particular strategy of the scientific method that has as an objective to analyse the perceptible behaviour that occurs in habitual contexts, allowing them to be formally recorded and quantified and using an ad hoc instrument in order to obtain a behaviour systematic registration that, since they have been transformed in quantitative data with the necessary reliability and validity determined level, will allow analysis of the relations between these behaviours. The codifications undertaken to date in various games of football have shown that it serves the purposes for which it was developed, allowing more research into the offensive game methods in football.

World Of Wars Android Game

World Of Wars es un videojuego de acción para plataformas Android basándose en los estilos shoot em¿up arcades antiguos pero adaptándolos a los nuevos tiempos y nuevas formas de juego que existen en la actualidad. Se ha utilizado la librería Cocos2D-x, así como el lenguaje de programación C++ para el desarrollo de el.

A geometric chracterization of the nucleolus of the assignment game

Maschler et al. (1979) caracteritzen geomètricament la intersecció del kernel i del core en els jocs cooperatius, demostrant que les distribucions que pertanyen a ambdós conjunts es troben en el punt mig d’un cert rang de negociació entre parelles de jugadors. En el cas dels jocs d’assignació, aquesta caracterització vol dir que el kernel només conté aquells elements del core on el màxim que un jugador pot transferir a una parella òptima és igual al màxim que aquesta parella li pot transferir, sense sortir-se’n del core. En aquest treball demostrem que el nucleolus d’un joc d’assignació queda caracteritzat si requerim que aquesta propietat de bisecció es compleixi no només per parelles, sinó també per coalicions entre sectors aparellades òptimament.

A geometric chracterization of the nucleolus of the assignment game

Maschler et al. (1979) caracteritzen geomètricament la intersecció del kernel i del core en els jocs cooperatius, demostrant que les distribucions que pertanyen a ambdós conjunts es troben en el punt mig d’un cert rang de negociació entre parelles de jugadors. En el cas dels jocs d’assignació, aquesta caracterització vol dir que el kernel només conté aquells elements del core on el màxim que un jugador pot transferir a una parella òptima és igual al màxim que aquesta parella li pot transferir, sense sortir-se’n del core. En aquest treball demostrem que el nucleolus d’un joc d’assignació queda caracteritzat si requerim que aquesta propietat de bisecció es compleixi no només per parelles, sinó també per coalicions entre sectors aparellades òptimament.

Conflicting claims problem associated with cost sharing of a network

A minimum cost spanning tree (mcst) problem analyzes the way to efficiently connect individuals to a source when they are located at different places. Once the efficient tree is obtained, the question on how allocating the total cost among the involved agents defines, in a natural way, a confliicting claims situation. For instance, we may consider the endowment as the total cost of the network, whereas for each individual her claim is the maximum amount she will be allocated, that is, her connection cost to the source. Obviously, we have a confliicting claims problem, so we can apply claims rules in order to obtain an allocation of the total cost. Nevertheless, the allocation obtained by using claims rules might not satisfy some appealing properties (in particular, it does not belong to the core of the associated cooperative game). We will define other natural claims problems that appear if we analyze the maximum and minimum amount that an individual should pay in order to support the minimum cost tree. Keywords: Minimum cost spanning tree problem, Claims problem, Core JEL classification: C71, D63, D71.

Complete Analysis of Configuration Rules to Guarantee Reliable Network Security Policies

Peer-reviewed

Detectings low introgression of invasive alleles in an extensively restocked game bird

Interbreeding of two species in the wild implies introgression of alleles from one species into the other only when admixed individuals survive and successfully backcross with the parental species. Consequently, estimating the proportion of first generation hybrids in a population may not inform about the evolutionary impact of hybridization. Samples obtained over a long time span may offer a more accurate view of the spreading of introgressed alleles in a species" gene pool. Common quail (Coturnix coturnix) populations in Europe have been restocked extensively with farm quails of hybrid origin (crosses with Japanese quails, C. japonica). We genetically monitored a common quail population over 15 years to investigate whether genetic introgression is occurring and used simulations to investigate our power to detect it. Our results revealed that some introgression has occurred, but we did not observe a significant increase over time in the proportion of admixed individuals. However, simulations showed that the degree of admixture may be larger than anticipated due to the limited power of analyses over a short time span, and that observed data was compatible with a low rate of introgression, probably resulting from reduced fitness of admixed individuals. Simulations predicted this could result in extensive admixture in the near future.

Effects of punishment in a mobile population playing the prisoner’s dilemma game

We deal with a system of prisoner’s dilemma players undergoing continuous motion in a two-dimensional plane. In contrast to previous work, we introduce altruistic punishment after the game. We find punishing only a few of the cooperator-defector interactions is enough to lead the system to a cooperative state in environments where otherwise defection would take over the population. This happens even with soft nonsocial punishment (where both cooperators and defectors punish other players, a behavior observed in many human populations). For high enough mobilities or temptations to defect, low rates of social punishment can no longer avoid the breakdown of cooperation

On the structure of cooperative and competitive solutions for a generalized assignment game

We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)'s assignment game. We consider the Core, three other notions of group stability and two al- ternative definitions of competitive equilibrium. We show that (i) each group stable set is closely related with the Core of certain games defined using a proper notion of blocking and (ii) each group stable set contains the set of payoff vectors associated to the two definitions of competitive equilibrium. We also show that all six solutions maintain a strictly nested structure. Moreover, each solution can be identified with a set of ma- trices of (discriminated) prices which indicate how gains from trade are distributed among buyers and sellers. In all cases such matrices arise as solutions of a system of linear inequalities. Hence, all six solutions have the same properties from a structural and computational point of view.