Game On: Know Alcohol - Interim findings from the first nine schools

A six module program designed to 1) show students the effects of alcohol, 2) impart knowledge of standard drinks and 3) provide students with strategies to moderate (or abstain) from alcohol drinking, is currently being tested in a cluster randomised control design in Queensland. This paper presents immediate evaluation results for the program that was designed using the eight National Social Marketing Centre (2009) benchmark criteria. Students have participated in baseline and/or immediate follow up evaluation in six intervention and three control schools to date. Early results suggest that Game On:Know Alcohol increases knowledge relating to alcohol and moderates attitudes towards binge drinking while maintaining behavioural intentions to drink alcohol excessively. Limitations of the current study and opportunities for future research are outlined.

The land hoarding and land inspector dilemma in China : an evolutionary game theoretic perspective

China has experienced considerable economic growth since 1978, which was accompanied by unprecedented growth in urbanization and, more recently, by associated rising urban housing and land banking issues. One such issue is that of land hoarding - where real estate developers purchase land to hold unused in the rising market for a future lucrative sale, often several years later. This practice is outlawed in China, where land use is controlled by increasingly strengthened Government policies and inspectors. Despite this, land hoarding continues apace, with the main culprits being the developers and inspectors working subversively. This resembles a game between two players - the inspector and the developer - which provides the setting for this paper in developing an evolutionary game theory model to provide insights into dealing with the dilemmas faced by the players. The logic and dilemma of land banking strategy and illegal land banking issues are analysed, along with the land inspector’s role from a game theory perspective by determining the replication dynamic mechanism and evolutionary stable strategies under the various conditions that the players face. The major factors influencing the actions of land inspectors, on the other hand, are the costs of inspection, no matter if it is strict or indolent, conflict costs, and income and penalties from corruption. From this, it is shown that, when the net loss for corruption (income from corruption minus the penalties for corruption and cost of strict inspections) is less than the cost of strict inspections, the final evolutionary stable strategy of the inspectors is to carry out indolent inspections. Then, whether penalising developers for hoarding is severe or not, the evolutionary strategy for the developer is to hoard. The implications for land use control mechanisms and associated developer-inspector actions and counteractions are then examined in the light of the model's properties.

Efficient minimax strategies for square loss games

We consider online prediction problems where the loss between the prediction and the outcome is measured by the squared Euclidean distance and its generalization, the squared Mahalanobis distance. We derive the minimax solutions for the case where the prediction and action spaces are the simplex (this setup is sometimes called the Brier game) and the \ell_2 ball (this setup is related to Gaussian density estimation). We show that in both cases the value of each sub-game is a quadratic function of a simple statistic of the state, with coefficients that can be efficiently computed using an explicit recurrence relation. The resulting deterministic minimax strategy and randomized maximin strategy are linear functions of the statistic.

Refinement of defection strategies stabilizes cooperation

Cooperation among unrelated individuals is an enduring evolutionary riddle and a number of possible solutions have been suggested. Most of these suggestions attempt to refine cooperative strategies, while little attention is given to the fact that novel defection strategies can also evolve in the population. Especially in the presence of punishment to the defectors and public knowledge of strategies employed by the players, a defecting strategy that avoids getting punished by selectively cooperating only with the punishers can get a selective benefit over non-conditional defectors. Furthermore, if punishment ensures cooperation from such discriminating defectors, defectors who punish other defectors can evolve as well. We show that such discriminating and punishing defectors can evolve in the population by natural selection in a Prisoner’s Dilemma game scenario, even if discrimination is a costly act. These refined defection strategies destabilize unconditional defectors. They themselves are, however, unstable in the population. Discriminating defectors give selective benefit to the punishers in the presence of non-punishers by cooperating with them and defecting with others. However, since these players also defect with other discriminators they suffer fitness loss in the pure population. Among the punishers, punishing cooperators always benefit in contrast to the punishing defectors, as the latter not only defect with other punishing defectors but also punish them and get punished. As a consequence of both these scenarios, punishing cooperators get stabilized in the population. We thus show ironically that refined defection strategies stabilize cooperation. Furthermore, cooperation stabilized by such defectors can work under a wide range of initial conditions and is robust to mistakes.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

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.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

A game theoretical multiple resource interaction approach to resource allocation in an air campaign

In this paper we propose a multiple resource interaction model in a game-theoretical framework to solve resource allocation problems in theater level military campaigns. An air raid campaign using SEAD aircraft and bombers against an enemy target defended by air defense units is considered as the basic platform. Conditions for the existence of saddle point in pure strategies is proved and explicit feedback strategies are obtained for a simplified model with linear attrition function limited by resource availability. An illustrative example demonstrates the key features.

A resource based game theoretical model for military conflicts

A resource interaction based game theoretical model for military conflicts is presented in this paper. The model includes both the spatial decision capability of adversaries (decision regarding movement and subsequent distribution of resources) as well as their temporal decision capability (decision regarding level of allocation of resources for conflict with adversary’s resources). Attrition is decided at present by simple deterministic models. An additional feature of this model is the inclusion of the possibility of a given resource interacting with several resources of the adversary.The decisions of the adversaries is determined by solving for the equilibrium Nash strategies given that the objectives of the adversaries may not be in direct conflict. Examples are given to show the applicability of these models and solution concepts.

Evolution of Cooperation in the Snowdrift Game with Incomplete Information and Heterogeneous Population

Differently from previous studies of tag-based cooperation, we assume that individuals fail to recognize their own tag. Due to such incomplete information, the action taken against the opponent cannot be based on similarity, although it is still motivated by the tag displayed by the opponent. We present stability conditions for the case when individuals play unconditional cooperation, unconditional defection or conditional cooperation. We then consider the removal of one or two strategies. Results show that conditional cooperators are the most resilient agents against extinction and that the removal of unconditional cooperators may lead to the extinction of unconditional defectors.

ADAPTECC: A Role-Play Game about Adapting to Climate Change

The ADAPTECC Climate Change Adaptation Game is a role-play game designed to enable players to experience the difficulties that arise at local and regional levels when authorities have to implement adaptation measures. Adaptation means anticipating the advert effects of climate change (CC) and taking measures to prevent and minimise the damage caused by its impacts. Each player takes the role of the mayor or a councillor of a town affected by CC who must decide what adaptation strategies and measures to take, or of a member of the Regional Environment Department which must distribute funding for adaptation among the various towns. At the end of the game, players should have a greater understanding of the challenges posed by adaptation to CC

A reason for unreason: returns-based beliefs in game theory

Players cooperate in experiments more than game theory would predict. We introduce the ‘returns-based beliefs’ approach: the expected returns of a particular strategy in proportion to total expected returns of all strategies. Using a decision analytic solution concept, Luce’s (1959) probabilistic choice model, and ‘hyperpriors’ for ambiguity in players’ cooperability, our approach explains empirical observations in various classes of games including the Prisoner’s and Traveler’s Dilemmas. Testing the closeness of fit of our model on Selten and Chmura (2008) data for completely mixed 2 × 2 games shows that with loss aversion, returns-based beliefs explain the data better than other equilibrium concepts.

Imperfect assessment and limited information preclude optimal strategies in male-male fights in the orb-weaving spider Metellina mengei

Agonistic behaviour between male orb-web spiders Metellina mengei competing for access to female webs was examined in field experiments to test the major predictions of game theory. Winners of fights were significantly larger than losers, particularly with respect to the length of the first pair of legs, which are sexually dimorphic in this species and used extensively in agonistic encounters. The size of the winning male had no influence on contest intensity or duration, and neither did relative size. However, fight intensity and duration were both positively correlated with the size of the losing male. Resident males won significantly more contests than intruders. Winning intruders were significantly larger than winning residents and it was these winning intruders that tended to produce the longer fights. Female weight and hence reproductive value had a marked influence on fight intensity and duration of fights won by the intruder but not those won by the resident. This indicates that only the resident obtains information about the female. These data are discussed with reference to the discrepancy with theory and a failure of some contestants to obtain information on resource value and relative contestant size necessary to optimize fight strategy.

Local Conventions in Game Play in an Evolving Dual Social Network Framework

People usually perform economic interactions within the social setting of a small group, while they obtain relevant information from a broader source. We capture this feature with a dynamic interaction model based on two separate social networks. Individuals play a coordination game in an interaction network, while updating their strategies using information from a separate influence network through which information is disseminated. In each time period, the interaction and influence networks co-evolve, and the individuals’ strategies are updated through a modified naive learning process. We show that both network structures and players’ strategies always reach a steady state, in which players form fully connected groups and converge to local conventions. We also analyze the influence exerted by a minority group of strongly opinionated players on these outcomes.

Selecting Robust Strategies in RTS Games via Concurrent Plan Augmentation

Thesis (Master's)--University of Washington, 2015