Cooperate Delegation of Computation for Rational Party Using Zero-Determinant Strategy Approach

Zhang, Duo; Tian, Youliang; Chaoyue, Yue; Fan, Mingming

doi:10.1109/access.2020.2971544

Cited by 7 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, the control ability of ZD strategies has also been extended [19], [20], [21]. As application studies, ZD strategies have been applied to several problems in the field of information and communications technology, such as resource sharing in wireless networks [22], [23], mining in blockchain [24], crowdsourcing [25], the Internet of Things [26], cloud computing [27], and data trading [28]. In terms of unbeatable strategies, the author proved that the unbeatable TFT is a ZD strategy in two-player symmetric games [29].…”

Section: Introductionmentioning

confidence: 99%

Unexploitable Games and Unbeatable Strategies

Ueda

2023

IEEE Access

View full text Add to dashboard Cite

Imitation is simple behavior which uses successful actions of others in order to deal with one's own problems. Because success of imitation generally depends on whether profit of an imitating agent coincides with those of other agents or not, game theory is suitable for specifying situations where imitation can be successful. One of the concepts describing successfulness of imitation in repeated two-player symmetric games is unbeatability. For infinitely repeated two-player symmetric games, a necessary and sufficient condition for some imitation strategy to be unbeatable was specified. However, situations where imitation can be unbeatable in multi-player games are still not clear. In order to analyze successfulness of imitation in multi-player situations, here we introduce a class of totally symmetric games called unexploitable games, which is a natural extension of two-player symmetric games without exploitation cycles. We then prove that, for infinitely repeated unexploitable games, there exist unbeatable imitation strategies. Furthermore, we also prove that, for infinitely repeated non-trivial unexploitable games, there exist unbeatable zerodeterminant strategies, which unilaterally enforce some relationships on payoffs of players. These claims are demonstrated in the public goods game, which is the simplest unexploitable game. These results show that there are situations where imitation is unbeatable even in multi-player games.INDEX TERMS Imitation strategies, repeated games, unbeatable strategies, zero-determinant strategies.

show abstract

Section: Introductionmentioning

confidence: 99%

Unexploitable Games and Unbeatable Strategies

Ueda

2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Apart from these theoretical studies on general properties of ZD strategies, there are many applications of ZD strategies. In the field of information and communications technology, ZD strategies have been applied in resource sharing in wireless networks [27,28], smart grid systems [29], mining in blockchain [30,31], crowdsourcing [32,33], mobile crowdsensing [34], the Internet of Things [35], cloud computing [36], federated learning [37], and data trading [38], in order to unilaterally realize some favorable states. Another field of application is analysis of imitation in behavioral science [39,40].…”

Section: Introductionmentioning

confidence: 99%

Necessary and Sufficient Condition for the Existence of Zero-Determinant Strategies in Repeated Games

Ueda¹

2022

J. Phys. Soc. Jpn.

View full text Add to dashboard Cite

Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of cooperation. So far, not only general properties of zerodeterminant strategies have been investigated, but zero-determinant strategies have been applied to control in the fields of information and communications technology and analysis of imitation. Here, we provide another example of application of zero-determinant strategies: control of a particle on a lattice. We first prove that zero-determinant strategies, if exist, can be implemented by some one-dimensional transition probability. Next, we prove that, if a two-player game has a non-trivial potential function, a zero-determinant strategy exists in its repeated version. These two results enable us to apply the concept of zero-determinant strategies to control the expected potential energies of two coordinates of a particle on a two-dimensional lattice.

show abstract

“…In addition, the zero-determinant strategy can be applied to cloud computing research. Zhang et al showed that a trusting party can regulate the actions of betrayers through a zero-determinant strategy, which insures the interests of honest people in the cloud computing environment [44].…”

Section: Introductionmentioning

confidence: 99%