Multicriterion differential games with applications to combat problems

In this paper a theory for two-person zero sum multicriterion differential games is presented. Various solution concepts based upon the notions of Pareto optimality (efficiency), security and equilibrium are defined. These are shown to have interesting applications in the formulation and analysis of two target or combat differential games. The methods for obtaining outcome regions in the state space, feedback strategies for the players and the mode of play has been discussed in the framework of bicriterion zero sum differential games. The treatment is conceptual rather than rigorous.

Bicriterion differential games with qualitative outcomes

Combat games are studied as bicriterion differential games with qualitative outcomes determined by threshold values on the criterion functions. Survival and capture strategies of the players are defined using the notion of security levels. Closest approach survival strategies (CASS) and minimum risk capture strategies (MRCS) are important strategies for the players identified as solutions to four optimization problems involving security levels. These are used, in combination with the preference orderings of the qualitative outcomes by the players, to delineate the win regions and the secured draw and mutual kill regions for the players. It is shown that the secured draw regions and the secured mutual kill regions for the two players are not necessarily the same. Simple illustrative examples are given.

Solution concepts in continuous-kernel multicriteria games

This paper considers nonzero-sum multicriteria games with continuous kernels. Solution concepts based on the notions of Pareto optimality, equilibrium, and security are extended to these games. Separate necessary and sufficient conditions and existence results are presented for equilibrium, Pareto-optimal response, and Pareto-optimal security strategies of the players.

Playing Games on Sets and Models

The most prominent objective of the thesis is the development of the generalized descriptive set theory, as we call it. There, we study the space of all functions from a fixed uncountable cardinal to itself, or to a finite set of size two. These correspond to generalized notions of the universal Baire space (functions from natural numbers to themselves with the product topology) and the Cantor space (functions from natural numbers to the {0,1}-set) respectively. We generalize the notion of Borel sets in three different ways and study the corresponding Borel structures with the aims of generalizing classical theorems of descriptive set theory or providing counter examples. In particular we are interested in equivalence relations on these spaces and their Borel reducibility to each other. The last chapter shows, using game-theoretic techniques, that the order of Borel equivalence relations under Borel reduciblity has very high complexity. The techniques in the above described set theoretical side of the thesis include forcing, general topological notions such as meager sets and combinatorial games of infinite length. By coding uncountable models to functions, we are able to apply the understanding of the generalized descriptive set theory to the model theory of uncountable models. The links between the theorems of model theory (including Shelah's classification theory) and the theorems in pure set theory are provided using game theoretic techniques from Ehrenfeucht-Fraïssé games in model theory to cub-games in set theory. The bottom line of the research declairs that the descriptive (set theoretic) complexity of an isomorphism relation of a first-order definable model class goes in synch with the stability theoretical complexity of the corresponding first-order theory. The first chapter of the thesis has slightly different focus and is purely concerned with a certain modification of the well known Ehrenfeucht-Fraïssé games. There we (me and my supervisor Tapani Hyttinen) answer some natural questions about that game mainly concerning determinacy and its relation to the standard EF-game

Determination of rational strategies for players in two-target games

This paper addresses some of the basic issues involved in the determination of rational strategies for players in two-target games. We show that unlike single-target games where the task of role assignment and selection of strategies is conceptually straightforward, in two-target games, many factors like the preference ordering of outcomes by players, the relative configuration of the target sets and secured outcome regions, the uncertainty about the parameters of the game, etc., also influence the rational selection of strategies by players. The importance of these issues is illustrated through appropriate examples.

General-sum stochastic games: Verifiability conditions for Nash equilibria

Unlike zero-sum stochastic games, a difficult problem in general-sum stochastic games is to obtain verifiable conditions for Nash equilibria. We show in this paper that by splitting an associated non-linear optimization problem into several sub-problems, characterization of Nash equilibria in a general-sum discounted stochastic games is possible. Using the aforementioned sub-problems, we in fact derive a set of necessary and sufficient verifiable conditions (termed KKT-SP conditions) for a strategy-pair to result in Nash equilibrium. Also, we show that any algorithm which tracks the zero of the gradient of the Lagrangian of every sub-problem provides a Nash strategy-pair. (c) 2012 Elsevier Ltd. All rights reserved.

Zero-sum risk-sensitive stochastic games on a countable state space

Infinite horizon discounted-cost and ergodic-cost risk-sensitive zero-sum stochastic games for controlled Markov chains with countably many states are analyzed. Upper and lower values for these games are established. The existence of value and saddle-point equilibria in the class of Markov strategies is proved for the discounted-cost game. The existence of value and saddle-point equilibria in the class of stationary strategies is proved under the uniform ergodicity condition for the ergodic-cost game. The value of the ergodic-cost game happens to be the product of the inverse of the risk-sensitivity factor and the logarithm of the common Perron-Frobenius eigenvalue of the associated controlled nonlinear kernels. (C) 2013 Elsevier B.V. All rights reserved.

Necessary and sufficient conditions for optimality in constrained general sum stochastic games

In this paper we first derive a necessary and sufficient condition for a stationary strategy to be the Nash equilibrium of discounted constrained stochastic game under certain assumptions. In this process we also develop a nonlinear (non-convex) optimization problem for a discounted constrained stochastic game. We use the linear best response functions of every player and complementary slackness theorem for linear programs to derive both the optimization problem and the equivalent condition. We then extend this result to average reward constrained stochastic games. Finally, we present a heuristic algorithm motivated by our necessary and sufficient conditions for a discounted cost constrained stochastic game. We numerically observe the convergence of this algorithm to Nash equilibrium. (C) 2015 Elsevier B.V. All rights reserved.

Effects of Small-Sided Games vs. Interval Training in Aerobic Fitness and Physical Enjoyment in Young Elite Soccer Players

The purpose of this study was to compare the effects of Small-Sided Games (SSG) vs. Interval Training (IT) in soccer training on aerobic fitness and physical enjoyment in youth elite soccer players during the last 8 weeks of the season. Seventeen U-16 male soccer players (age = 15.5 +/- 0.6 years, and 8.5 years of experience) of a Spanish First Division club academy were randomized to 2 different groups for 6 weeks: SSG group (n = 9) and IT group (n = 8). In addition to the usual technical and tactical sessions and competitive games, the SSG group performed 11 sessions with different SSGs, whereas the IT group performed the same number of sessions of IT. Players were tested before and after the 6-week training intervention with a continuous maximal multistage running field test and the counter movement jump test (CMJ). At the end of the study, players answered the physical activity enjoyment scale (PACES). During the study, heart rate (HR) and session perceived effort (sRPE) were assessed. SSGs were as effective as IT in maintaining the aerobic fitness in elite young soccer players during the last weeks of the season. Players in the SSG group declared a greater physical enjoyment than IT (P = 0.006; ES = 1.86 +/- 1.07). Coaches could use SSG training during the last weeks of the season as an option without fear of losing aerobic fitness while promoting high physical enjoyment.

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.

Efficient energy distribution in a smart grid using multi-player games

info:eu-repo/semantics/submittedForPublication

Video games in the classrooms: implications of a disruptive innovation to develop the Multiple Intelligences

The present study aims to identify the framework of personal, organizational and technical variables that contribute to the viability and successful of innovative educational practices with video games within the school context to enhance the multiple intelligences. For this purpose, advantage was taken on the information previously collected through a questionnaire about the views, thoughts and experiences of a group of teachers of childhood and primary education (N=25) who voluntarily participated in a blended training activity from Center of Teachers (CEFIRE) of Valencia, around a community of practice aimed at promoting and advising projects for implementing educational video games in the classroom. The mixed methodology adopted has allowed the following: a) describe the relationship between their degree of development and daily use made of ICT in the classroom, their level of familiarity with video games,  their previous experience to integrate them for educational purposes..., and their participation in projects that focus on game-based learning; b) conduct content analysis of the opinions and thoughts expressed in a forum for teachers on innovation on and methodological strategies adopted reflected in a virtual board; and c) develop a SWOT analysis: Strengths, Weaknesses, Opportunities and Threats inherent in the implementation of experience with video games in the classroom. Among the conclusions, it is highlighted that, even though most did not have specific training or enough technological resources and the planning and implementation of innovation required them a great investment of time, their personal interest, the support given by members of the online community of practice, helped to encourage their activity, along with receptivity, positive attitude and high motivation of students with the experience. These aspects have been crucial to promote successful innovative practices with video games.

The influence of video games with apocalyptic content in adolescents

The aim of this study is the dissertation and analysis of the influence (sociological, psychological and cultural) exerted on adolescents by the concept of Apocalypse. Become a key thought of visual culture, the called doomsday theory achieves one of its highest expressions in video games, possibly the favorite entertainment for young people in their leisure time. The results obtained in this research represent a first approach to the subject through the selected samples, two secondary schools from the city of Seville with disparate locations and divergent socioeconomic backgrounds. To reinforce the comparative study, we have included issues related to parental control, principal gaming platforms used by respondents or the number of hours dedicated to this type of entertainment. The conclusions demonstrate an irremediable attraction from our youth towards apocalyptic universes, plotter consciously with leisure and entertainment as escape from their routine of everyday life.

Labor unions and Nash bargaining using coalition formation games

In this paper we examine the properties of stable coalitions under sequential and simultaneous bargaining by competing labor unions. We do this using the Nash bargaining solution and various notions of stability, namely, Nash, coalitional, contractual and core stability. (C) 2011 Elsevier B.V. All rights reserved,