Related papers: Outlearning Extortioners by Fair-minded Unbending …
The actions of intelligent agents, such as chatbots, recommender systems, and virtual assistants are typically not fully transparent to the user. Consequently, using such an agent involves the user exposing themselves to the risk that the…
Tit-for-Tat strategy is a strategy in repeated two-player symmetric games which imitates the previous action of the opponent. We show that the Tit-for-Tat strategy is a zero-determinant strategy, which unilaterally equalizes the expected…
Despite incredible advances, deep learning has been shown to be susceptible to adversarial attacks. Numerous approaches have been proposed to train robust networks both empirically and certifiably. However, most of them defend against only…
Punishment and partner switching are two well-studied mechanisms that support the evolution of cooperation. Observation of human behaviour suggests that the extent to which punishment is adopted depends on the usage of alternative…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. In complex networks, because of the difficulty of formulating the replicator dynamics, most of previous studies are…
Evolution occurs in populations of reproducing individuals. Reproduction depends on the payoff a strategy receives. The payoff depends on the environment that may change over time, on intrinsic uncertainties, and on other sources of…
Adversarial training aims to defend against adversaries: malicious opponents whose sole aim is to harm predictive performance in any way possible. This presents a rather harsh perspective, which we assert results in unnecessarily…
Game theory formalizes certain interactions between physical particles or between living beings in biology, sociology, and economics, and quantifies the outcomes by payoffs. The prisoner's dilemma (PD) describes situations in which it is…
Imitation sometimes achieves success in multi-agent situations even though it is very simple. In game theory, success of imitation has been characterized by unbeatability against other agents. Previous studies specified conditions under…
In an iterated game between two players, there is much interest in characterizing the set of feasible payoffs for both players when one player uses a fixed strategy and the other player is free to switch. Such characterizations have led to…
We consider a version of the ultimatum game which simultaneously combines reactive and Darwinian aspects with offers in [0,1]. By reactive aspects, we consider the effects that lead the player to change their offer given the previous…
Across many domains of interaction, both natural and artificial, individuals use past experience to shape future behaviors. The results of such learning processes depend on what individuals wish to maximize. A natural objective is one's own…
In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a…
We study the emergency of mutual cooperation in evolutionary prisoner's dilemma games when the players are located on a square lattice. The players can choose one of the three strategies: cooperation (C), defection (D) or "tit for tat" (T),…
Controlling payoffs in repeated games is one of the important topics in control theory of multi-agent systems. Recently proposed zero-determinant strategies enable players to unilaterally enforce linear relations between payoffs.…
We define a new strategy for population games based on techniques from machine learning and statistical inference that is essentially uninvadable and can successfully invade (significantly more likely than a neutral mutant) essentially all…
Two cases of evolutionary stable strategy with periodic payoffs are studied. The first is a generalization of Uyttendaele et al. The second is prisoner's dilemma with periodic payoff. It is shown that reducing the defection payoff by a…
We consider the coupled dynamics of the adaption of network structure and the evolution of strategies played by individuals occupying the network vertices. We propose a computational model in which each agent plays a $n$-round Prisoner's…
In a social dilemma situation, where individual and collective interests are in conflict, it sounds a reasonable assumption that the presence of super or smart players, who simultaneously punish defection and reward cooperation without…