Dynamics of Spatial Game Theory Networks with Novel Modifications

Introduction: Advances in biotechnology have shed light on many biological processes. In biological networks, nodes are used to represent the function of individual entities within a system and have historically been studied in isolation. Network structure adds edges that enable communication between nodes. An emerging fieldis to combine node function and network structure to yield network function. One of the most complex networks known in biology is the neural network within the brain. Modeling neural function will require an understanding of networks, dynamics, andneurophysiology. It is with this work that modeling techniques will be developed to work at this complex intersection. Methods: Spatial game theory was developed by Nowak in the context of modeling evolutionary dynamics, or the way in which species evolve over time. Spatial game theory offers a two dimensional view of analyzingthe state of neighbors and updating based on the surroundings. Our work builds upon this foundation by studying evolutionary game theory networks with respect to neural networks. This novel concept is that neurons may adopt a particular strategy that will allow propagation of information. The strategy may therefore act as the mechanism for gating. Furthermore, the strategy of a neuron, as in a real brain, isimpacted by the strategy of its neighbors. The techniques of spatial game theory already established by Nowak are repeated to explain two basic cases and validate the implementation of code. Two novel modifications are introduced in Chapters 3 and 4 that build on this network and may reflect neural networks. Results: The introduction of two novel modifications, mutation and rewiring, in large parametricstudies resulted in dynamics that had an intermediate amount of nodes firing at any given time. Further, even small mutation rates result in different dynamics more representative of the ideal state hypothesized. Conclusions: In both modificationsto Nowak's model, the results demonstrate the network does not become locked into a particular global state of passing all information or blocking all information. It is hypothesized that normal brain function occurs within this intermediate range and that a number of diseases are the result of moving outside of this range.

Game Theory Models for Multi-Robot Patrolling of Infraestructures

Abstract This work is focused on the problem of performing multi‐robot patrolling for infrastructure security applications in order to protect a known environment at critical facilities. Thus, given a set of robots and a set of points of interest, the patrolling task consists of constantly visiting these points at irregular time intervals for security purposes. Current existing solutions for these types of applications are predictable and inflexible. Moreover, most of the previous centralized and deterministic solutions and only few efforts have been made to integrate dynamic methods. Therefore, the development of new dynamic and decentralized collaborative approaches in order to solve the aforementioned problem by implementing learning models from Game Theory. The model selected in this work that includes belief‐based and reinforcement models as special cases is called Experience‐Weighted Attraction. The problem has been defined using concepts of Graph Theory to represent the environment in order to work with such Game Theory techniques. Finally, the proposed methods have been evaluated experimentally by using a patrolling simulator. The results obtained have been compared with previous available

Data Fusion based on Game Theory for Speaker Diarization

A novel algorithm based on bimatrix game theory has been developed to improve the accuracy and reliability of a speaker diarization system. This algorithm fuses the output data of two open-source speaker diarization programs, LIUM and SHoUT, taking advantage of the best properties of each one. The performance of this new system has been tested by means of audio streams from several movies. From preliminary results on fragments of five movies, improvements of 63% in false alarms and missed speech mistakes have been achieved with respect to LIUM and SHoUT systems working alone. Moreover, we also improve in a 20% the number of recognized speakers, getting close to the real number of speakers in the audio stream

A game theory based strategy for reducing energy consumption in cognitive WSN

Wireless sensor networks (WSNs) are one of the most important users of wireless communication technologies in the coming years and some challenges in this area must be addressed for their complete development. Energy consumption and spectrum availability are two of the most severe constraints of WSNs due to their intrinsic nature. The introduction of cognitive capabilities into these networks has arisen to face the issue of spectrum scarcity but could be used to face energy challenges too due to their new range of communication possibilities. In this paper a new strategy based on game theory for cognitive WSNs is discussed. The presented strategy improves energy consumption by taking advantage of the new change-communication-channel capability. Based on game theory, the strategy decides when to change the transmission channel depending on the behavior of the rest of the network nodes. The strategy presented is lightweight but still has higher energy saving rates as compared to noncognitive networks and even to other strategies based on scheduled spectrum sensing. Simulations are presented for several scenarios that demonstrate energy saving rates of around 65% as compared to WSNs without cognitive techniques.

Stochastic game theory: For playing games, not just for doing theory

Recent theoretical advances have dramatically increased the relevance of game theory for predicting human behavior in interactive situations. By relaxing the classical assumptions of perfect rationality and perfect foresight, we obtain much improved explanations of initial decisions, dynamic patterns of learning and adjustment, and equilibrium steady-state distributions.

Game theory and programming; National Science Foundation summer mathematics institute notes.

Bibliography: leaves [87]-[88]

Stochastic dynamic programming for election timing: A game theory approach

In this paper, we consider dynamic programming for the election timing in the majoritarian parliamentary system such as in Australia, where the government has a constitutional right to call an early election. This right can give the government an advantage to remain in power for as long as possible by calling an election, when its popularity is high. On the other hand, the opposition's natural objective is to gain power, and it will apply controls termed as "boosts" to reduce the chance of the government being re-elected by introducing policy and economic responses. In this paper, we explore equilibrium solutions to the government, and the opposition strategies in a political game using stochastic dynamic programming. Results are given in terms of the expected remaining life in power, call and boost probabilities at each time at any level of popularity.

Cooperation in an HMMS-type supply chain: A management application of cooperative game theory = Kooperáció egy HMMS-típusú ellátási láncban: A kooperatív játékelmélet egy menedzsment alkalmazása

We apply cooperative game theory concepts to analyze a Holt-Modigliani-Muth-Simon (HMMS) supply chain. The bullwhip effect in a two-stage supply chain (supplier-manufacturer) in the framework of the HMMS-model with quadratic cost functions is considered. It is assumed that both firms minimize their relevant costs, and two cases are examined: the supplier and the manufacturer minimize their relevant costs in a decentralized and in a centralized (cooperative) way. The question of how to share the savings of the decreased bullwhip effect in the centralized (cooperative) model is answered by the weighted Shapley value, by a transferable utility cooperative game theory tool, where the weights are for the exogenously given “bargaining powers” of the participants of the supply chain. = A cikkben a kooperatív játékelmélet fogalmait alkalmazzuk egy Holt-Mogigliani-Muth-Simon-típusú ellátási lánc esetében. Az ostorcsapás-hatás elemeit egy beszállító-termelő ellátási láncban ragadjuk meg egy kvadratikus készletezési és termelési költség mellett. Feltételezzük, hogy mindkét vállalat minimalizálja a releváns költségeit. Két működési rendszert hasonlítunk össze: egy hierarchikus döntéshozatali rendszert, amikor először a termelő, majd a beszállító optimalizálja helyzetét, majd egy centralizált (kooperatív) modellt, amikor a vállalatok az együttes költségüket minimalizálják. A kérdés úgy merül fel, hogy a csökkentett ostorcsapás-hatás esetén hogyan osszák meg a részvevők ebben a transzferálható hasznosságú kooperatív játékban a költség megtakarítást, exogén módon adott tárgyalási pozíció mellett.

Climate change in game theory context

The aim of this paper is to survey the game theory modelling of the behaviour of global players in mitigation and adaptation related to climate change. Three main fields are applied for the specific aspects of temperature rise: behaviour games, CPR problem and negotiation games. The game theory instruments are useful in analyzing strategies in uncertain circumstances, such as the occurrence and impacts of climate change. To analyze the international players’ relations, actions, attitude toward carbon emission, negotiation power and motives, several games are applied for the climate change in this paper. The solution is surveyed, too, for externality problem.

Climate change in game theory

The study provides an overview of the application possibilities of game theory to climate change. The characteristics of games are adapted to the topics of climate and carbon. The importance of uncertainty, probability, marginal value of adaptation, common pool resources, etc. are tailored to the context of international relations and the challenge of global warming.

Modeling security and cooperation in wireless networks using game theory

This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory was used to analyze strategic interaction among independent devices with conflicting interests. Packet forwarding at the routing layer of autonomous ad hoc networks was investigated. Unlike existing reputation based or payment schemes, this model is based on repeated interactions. To enforce cooperation, a community enforcement mechanism was used, whereby selfish nodes that drop packets were punished not only by the victim, but also by all nodes in the network. Then, a stochastic packet forwarding game strategy was introduced. Our solution relaxed the uniform traffic demand that was pervasive in other works. To address the concerns of imperfect private monitoring in resource aware ad hoc networks, a belief-free equilibrium scheme was developed that reduces the impact of noise in cooperation. This scheme also eliminated the need to infer the private history of other nodes. Moreover, it simplified the computation of an optimal strategy. The belief-free approach reduced the node overhead and was easily tractable. Hence it made the system operation feasible. Motivated by the versatile nature of evolutionary game theory, the assumption of a rational node is relaxed, leading to the development of a framework for mitigating routing selfishness and misbehavior in Multi hop networks. This is accomplished by setting nodes to play a fixed strategy rather than independently choosing a rational strategy. A range of simulations was carried out that showed improved cooperation between selfish nodes when compared to older results. Cooperation among ad hoc nodes can also protect a network from malicious attacks. In the absence of a central trusted entity, many security mechanisms and privacy protections require cooperation among ad hoc nodes to protect a network from malicious attacks. Therefore, using game theory and evolutionary game theory, a mathematical framework has been developed that explores trust mechanisms to achieve security in the network. This framework is one of the first steps towards the synthesis of an integrated solution that demonstrates that security solely depends on the initial trust level that nodes have for each other.^

Human cooperation based on punishment reputation.

The threat of punishment usually promotes cooperation. However, punishing itself is costly, rare in nonhuman animals, and humans who punish often finish with low payoffs in economic experiments. The evolution of punishment has therefore been unclear. Recent theoretical developments suggest that punishment has evolved in the context of reputation games. We tested this idea in a simple helping game with observers and with punishment and punishment reputation (experimentally controlling for other possible reputational effects). We show that punishers fully compensate their costs as they receive help more often. The more likely defection is punished within a group, the higher the level of within-group cooperation. These beneficial effects perish if the punishment reputation is removed. We conclude that reputation is key to the evolution of punishment.

Théorie des jeux expérimentale & action motrice

How do sportspeople succeed in a non-collaborative game? An illustration of a perverse side effect of altruism Are team sports specialists predisposed to collaboration? The scientific literature on this topic is divided. The present article attempts to end this debate by applying experimental game theory. We constituted three groups of volunteers (all students aged around 20): 25 team sports specialists; 23 individual sports specialists (gymnasts, track & field athletes and swimmers) and a control group of 24 non-sportspeople. Each subgroup was divided into 3 teams that played against each other in turn (and not against teams from other subgroups). The teams played a game based on the well-known Prisoner's Dilemma (Tucker, 1950) - the paradoxical "Bluegill Sunbass Game" (Binmore, 1999) with three Nash equilibria (two suboptimal equilibria with a pure strategy and an optimal equilibrium with a mixed, egotistical strategy (p= 1/2)). This game also features a Harsanyi equilibrium (based on constant compliance with a moral code and altruism by empathy: "do not unto others that which you would not have them do unto you"). How, then, was the game played? Two teams of 8 competed on a handball court. Each team wore a distinctive jersey. The game lasted 15 minutes and the players were allowed to touch the handball ball with their feet or hands. After each goal, each team had to return to its own half of the court. Players were allowed to score in either goal and thus cooperate with their teammates or not, as they saw fit. A goal against the nominally opposing team (a "guardian" strategy, by analogy with the Bluegill Sunbass Game) earned a point for everyone in the team. For an own goal (a "sneaker" strategy), only the scorer earned a point - hence the paradox. If all the members of a team work together to score a goal, everyone is happy (the Harsanyi solution). However, the situation was not balanced in the Nashian sense: each player had a reason to be disloyal to his/her team at the merest opportunity. But if everyone adopts a "sneaker" strategy, the game becomes a free-for-all and the chances of scoring become much slimmer. In a context in which doubt reigns as to the honesty of team members and "legal betrayals", what type of sportsperson will score the most goals? By analogy with the Bluegill Sunbass Game, we recorded direct motor interactions (passes and shots) based on either a "guardian" tactic (i.e. collaboration within the team) or a "sneaker" tactic (shots and passes against the player's designated team). So, was the group of team sports specialist more collaborative than the other two groups? The answer was no. A statistical analysis (difference from chance in a logistic regression) enabled us to draw three conclusions: ?For the team sports specialists, the Nash equilibrium (1950) was stronger than the Harsanyi equilibrium (1977). ?The sporting principles of equilibrium and exclusivity are not appropriate in the Bluegill Sunbass Game and are quickly abandoned by the team sports specialists. The latter are opportunists who focus solely on winning and do well out of it. ?The most altruistic players are the main losers in the Bluegill Sunbass Game: they keep the game alive but contribute to their own defeat. In our experiment, the most altruistic players tended to be the females and the individual sports specialists

Théorie des jeux expérimentale & action motrice

How do sportspeople succeed in a non-collaborative game? An illustration of a perverse side effect of altruism Are team sports specialists predisposed to collaboration? The scientific literature on this topic is divided. The present article attempts to end this debate by applying experimental game theory. We constituted three groups of volunteers (all students aged around 20): 25 team sports specialists; 23 individual sports specialists (gymnasts, track & field athletes and swimmers) and a control group of 24 non-sportspeople. Each subgroup was divided into 3 teams that played against each other in turn (and not against teams from other subgroups). The teams played a game based on the well-known Prisoner's Dilemma (Tucker, 1950) - the paradoxical "Bluegill Sunbass Game" (Binmore, 1999) with three Nash equilibria (two suboptimal equilibria with a pure strategy and an optimal equilibrium with a mixed, egotistical strategy (p= 1/2)). This game also features a Harsanyi equilibrium (based on constant compliance with a moral code and altruism by empathy: "do not unto others that which you would not have them do unto you"). How, then, was the game played? Two teams of 8 competed on a handball court. Each team wore a distinctive jersey. The game lasted 15 minutes and the players were allowed to touch the handball ball with their feet or hands. After each goal, each team had to return to its own half of the court. Players were allowed to score in either goal and thus cooperate with their teammates or not, as they saw fit. A goal against the nominally opposing team (a "guardian" strategy, by analogy with the Bluegill Sunbass Game) earned a point for everyone in the team. For an own goal (a "sneaker" strategy), only the scorer earned a point - hence the paradox. If all the members of a team work together to score a goal, everyone is happy (the Harsanyi solution). However, the situation was not balanced in the Nashian sense: each player had a reason to be disloyal to his/her team at the merest opportunity. But if everyone adopts a "sneaker" strategy, the game becomes a free-for-all and the chances of scoring become much slimmer. In a context in which doubt reigns as to the honesty of team members and "legal betrayals", what type of sportsperson will score the most goals? By analogy with the Bluegill Sunbass Game, we recorded direct motor interactions (passes and shots) based on either a "guardian" tactic (i.e. collaboration within the team) or a "sneaker" tactic (shots and passes against the player's designated team). So, was the group of team sports specialist more collaborative than the other two groups? The answer was no. A statistical analysis (difference from chance in a logistic regression) enabled us to draw three conclusions: ?For the team sports specialists, the Nash equilibrium (1950) was stronger than the Harsanyi equilibrium (1977). ?The sporting principles of equilibrium and exclusivity are not appropriate in the Bluegill Sunbass Game and are quickly abandoned by the team sports specialists. The latter are opportunists who focus solely on winning and do well out of it. ?The most altruistic players are the main losers in the Bluegill Sunbass Game: they keep the game alive but contribute to their own defeat. In our experiment, the most altruistic players tended to be the females and the individual sports specialists