Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Memory-two zero-determinant strategies in repeated games.

ABSTRACT: Repeated games have provided an explanation of how mutual cooperation can be achieved even if defection is more favourable in a one-shot game in the Prisoner's Dilemma situation. Recently found zero-determinant (ZD) strategies have substantially been investigated in evolutionary game theory. The original memory-one ZD strategies unilaterally enforce linear relationships between average pay-offs of players. Here, we extend the concept of ZD strategies to memory-two strategies in repeated games. Memory-two ZD strategies unilaterally enforce linear relationships between correlation functions of pay-offs and pay-offs of the previous round. Examples of memory-two ZD strategy in the repeated Prisoner's Dilemma game are provided, some of which generalize the tit-for-tat strategy to a memory-two case. Extension of ZD strategies to memory-n case with n ≥ ~2 is also straightforward.

SUBMITTER: Ueda M

PROVIDER: S-EPMC8150048 | biostudies-literature | 2021 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Memory-two zero-determinant strategies in repeated games.

Ueda Masahiko M

Royal Society open science 20210526 5

Repeated games have provided an explanation of how mutual cooperation can be achieved even if defection is more favourable in a one-shot game in the Prisoner's Dilemma situation. Recently found zero-determinant (ZD) strategies have substantially been investigated in evolutionary game theory. The original memory-one ZD strategies unilaterally enforce linear relationships between average pay-offs of players. Here, we extend the concept of ZD strategies to memory-two strategies in repeated games. M ...[more]

PMID: 34084544

Similar Datasets

Linear algebraic structure of zero-determinant strategies in repeated games.

Project description:Zero-determinant (ZD) strategies, a recently found novel class of strategies in repeated games, has attracted much attention in evolutionary game theory. A ZD strategy unilaterally enforces a linear relation between average payoffs of players. Although existence and evolutional stability of ZD strategies have been studied in simple games, their mathematical properties have not been well-known yet. For example, what happens when more than one players employ ZD strategies have not been clarified. In this paper, we provide a general framework for investigating situations where more than one players employ ZD strategies in terms of linear algebra. First, we theoretically prove that a set of linear relations of average payoffs enforced by ZD strategies always has solutions, which implies that incompatible linear relations are impossible. Second, we prove that linear payoff relations are independent of each other under some conditions. These results hold for general games with public monitoring including perfect-monitoring games. Furthermore, we provide a simple example of a two-player game in which one player can simultaneously enforce two linear relations, that is, simultaneously control her and her opponent's average payoffs. All of these results elucidate general mathematical properties of ZD strategies.

| S-EPMC7117786 | biostudies-literature

Zero-Determinant Strategies in Iterated Public Goods Game.

Project description:Recently, Press and Dyson have proposed a new class of probabilistic and conditional strategies for the two-player iterated Prisoner's Dilemma, so-called zero-determinant strategies. A player adopting zero-determinant strategies is able to pin the expected payoff of the opponents or to enforce a linear relationship between his own payoff and the opponents' payoff, in a unilateral way. This paper considers zero-determinant strategies in the iterated public goods game, a representative multi-player game where in each round each player will choose whether or not to put his tokens into a public pot, and the tokens in this pot are multiplied by a factor larger than one and then evenly divided among all players. The analytical and numerical results exhibit a similar yet different scenario to the case of two-player games: (i) with small number of players or a small multiplication factor, a player is able to unilaterally pin the expected total payoff of all other players; (ii) a player is able to set the ratio between his payoff and the total payoff of all other players, but this ratio is limited by an upper bound if the multiplication factor exceeds a threshold that depends on the number of players.

| S-EPMC4543983 | biostudies-literature

Misperception influence on zero-determinant strategies in iterated Prisoner's Dilemma.

Project description:Zero-determinant (ZD) strategies have attracted wide attention in Iterated Prisoner's Dilemma (IPD) games, since the player equipped with ZD strategies can unilaterally enforce the two players' expected utilities subjected to a linear relation. On the other hand, uncertainties, which may be caused by misperception, occur in IPD inevitably in practical circumstances. To better understand the situation, we consider the influence of misperception on ZD strategies in IPD, where the two players, player X and player Y, have different cognitions, but player X detects the misperception and it is believed to make ZD strategies by player Y. We provide a necessary and sufficient condition for the ZD strategies in IPD with misperception, where there is also a linear relationship between players' utilities in player X's cognition. Then we explore bounds of players' expected utility deviation from a linear relationship in player X's cognition with also improving its own utility.

| S-EPMC8956668 | biostudies-literature

Evolutionary instability of selfish learning in repeated games.

Project description: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 success. However, when two such "selfish" learners interact with each other, the outcome can be detrimental to both, especially when there are conflicts of interest. Here, we explore how a learner can align incentives with a selfish opponent. Moreover, we consider the dynamics that arise when learning rules themselves are subject to evolutionary pressure. By combining extensive simulations and analytical techniques, we demonstrate that selfish learning is unstable in most classical two-player repeated games. If evolution operates on the level of long-run payoffs, selection instead favors learning rules that incorporate social (other-regarding) preferences. To further corroborate these results, we analyze data from a repeated prisoner's dilemma experiment. We find that selfish learning is insufficient to explain human behavior when there is a trade-off between payoff maximization and fairness.

| S-EPMC9802390 | biostudies-literature

Self-enforcing strategies to deter free-riding in the climate change mitigation game and other repeated public good games.

Project description:As the Copenhagen Accord indicates, most of the international community agrees that global mean temperature should not be allowed to rise more than two degrees Celsius above preindustrial levels to avoid unacceptable damages from climate change. The scientific evidence distilled in the Fourth Assessment Report of the Intergovernmental Panel on Climate Change and recent reports by the US National Academies shows that this can only be achieved by vast reductions of greenhouse gas emissions. Still, international cooperation on greenhouse gas emissions reductions suffers from incentives to free-ride and to renegotiate agreements in case of noncompliance, and the same is true for other so-called "public good games." Using game theory, we show how one might overcome these problems with a simple dynamic strategy of linear compensation when the parameters of the problem fulfill some general conditions and players can be considered to be sufficiently rational. The proposed strategy redistributes liabilities according to past compliance levels in a proportionate and timely way. It can be used to implement any given allocation of target contributions, and we prove that it has several strong stability properties.

| S-EPMC3179122 | biostudies-literature

Culture-dependent strategies in coordination games.

Project description:We examine different populations' play in coordination games in online experiments with over 1,000 study participants. Study participants played a two-player coordination game that had multiple equilibria: two equilibria with highly asymmetric payoffs and another equilibrium with symmetric payoffs but a slightly lower total payoff. Study participants were predominantly from India and the United States. Study participants residing in India played the strategies leading to asymmetric payoffs significantly more frequently than study participants residing in the United States who showed a greater play of the strategy leading to the symmetric payoffs. In addition, when prompted to play asymmetrically, the population from India responded even more significantly than those from the United States. Overall, study participants' predictions of how others would play were more accurate when the other player was from their own populations, and they coordinated significantly more frequently and earned significantly higher payoffs when matched with other study participants from their own population than when matched across populations.

| S-EPMC4113921 | biostudies-other

Are two interviews better than one? eyewitness memory across repeated cognitive interviews.

Project description:Eyewitnesses to a filmed event were interviewed twice using a Cognitive Interview to examine the effects of variations in delay between the repeated interviews (immediately & 2 days; immediately & 7 days; 7 & 9 days) and the identity of the interviewers (same or different across the two repeated interviews). Hypermnesia (an increase in total amount of information recalled in the repeated interview) occurred without any decrease in the overall accuracy. Reminiscence (the recall of new information in the repeated interview) was also found in all conditions but was least apparent in the longest delay condition, and came with little cost to the overall accuracy of information gathered. The number of errors, increased across the interviews, but the relative accuracy of participants' responses was unaffected. However, when accuracy was calculated based on all unique details provided across both interviews and compared to the accuracy of recall in just the first interview it was found to be slightly lower. The identity of the interviewer (whether the same or different across interviews) had no effects on the number of correct details. There was an increase in recall of new details with little cost to the overall accuracy of information gathered. Importantly, these results suggest that witnesses are unlikely to report everything they remember during a single Cognitive Interview, however exhaustive, and a second opportunity to recall information about the events in question may provide investigators with additional information.

| S-EPMC3789709 | biostudies-literature

Zero-determinant strategy in stochastic Stackelberg asymmetric security game.

Project description:In a stochastic Stackelberg asymmetric security game, the strong Stackelberg equilibrium (SSE) strategy is a popular option for the defender to get the highest utility against an attacker with the best response (BR) strategy. However, the attacker may be a boundedly rational player, who adopts a combination of the BR strategy and a fixed stubborn one. In such a condition, the SSE strategy may not maintain the defensive performance due to the stubbornness. In this paper, we focus on how the defender can adopt the unilateral-control zero-determinate (ZD) strategy to confront the boundedly rational attacker. At first, we verify the existence of ZD strategies for the defender. We then investigate the performance of the defender's ZD strategy against a boundedly rational attacker, with a comparison of the SSE strategy. Specifically, when the attacker's strategy is close to the BR strategy, the ZD strategy admits a bounded loss for the defender compared with the SSE strategy. Conversely, when the attacker's strategy is close to the stubborn strategy, the ZD strategy can bring higher defensive performance for the defender than the SSE strategy does.

| S-EPMC10338512 | biostudies-literature

Transparency and cooperation in repeated dilemma games: a meta study.

Project description:We use data from experiments on finitely repeated dilemma games with fixed matching to investigate the effect of different types of information on cooperation. The data come from 71 studies using the voluntary contributions paradigm, covering 122 data points, and from 18 studies on decision-making in oligopoly, covering another 50 data points. We find similar effects in the two sets of experimental games. We find that transparency about what everyone in a group earns reduces contributions to the public good, as well as the degree of collusion in oligopoly markets. In contrast, transparency about choices tends to lead to an increase in contributions and collusion, although the size of this effect varies somewhat between the two settings. Our results are potentially useful for policy making, because they provide guidance on the type of information to target in order to stimulate or limit cooperation.

| S-EPMC5665965 | biostudies-literature

Mitigation of block withholding attack based on zero-determinant strategy.

Project description:This article focuses on the mining dilemma of block withholding attack between the mining pools in the bitcoin system. In order to obtain the higher revenue, the rational mining pool usually chooses an infiltration attack, that is, the pool will falls into the mining dilemma of the PoW consensus algorithm. Thus the article proposes to apply zero-determinant strategies for optimizing the behavior selection of the mining pool under PoW consensus mechanism to increase the total revenues of the system, so as to solve the mining dilemma. After theoretically studying the set and extortionate strategy of zero-determinant, the article devises an adaptive zero-determinant strategy that the pool can change the corporation probability of the next round based on its previous revenues. To verify the effectiveness of zero-determinant strategies, based on the actual revenue of the mining pool defined and deduced in the paper, it simulates 30 sets of game strategies to illustrate the revenue variation of the mining pools. The simulation results show that the three zero-determinant strategies can effectively improve the convergence rate of cooperation, mitigate block withholding attack and maximize the total revenues of the system. Compared with the set and extortionate strategy, the adaptive strategy can ensure more stability and more revenue.

| S-EPMC9455053 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data