Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
Asymmetric Interactions between Cooperators and Defectors for Controlling Self-repairing
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Fault-tolerant strategies in the Iterated Prisoner's Dilemma
Information Processing Letters
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A network self-repair by spatial strategies in spatial prisoner's dilemma
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
A critical phenomenon in a self-repair network by mutual copying
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Computer Science Review
| Hi-index | 0.00 |
We propose the concept of an adaptive strategy, and we consider its robustness against other strategies. On average, the adaptive strategy achieves a higher payoff than other strategies. The strength of a strategy is defined as an adaptive measure calculated on the basis of a payoff obtained through interactions among agents. An agent interacts with other agents by selecting various strategies in computer networks. For the adaptive strategy, we give a formal definition of the adaptive measure of how well it behaves against other strategies. We present a calculation example of the adaptive measure for the iterated prisoner's dilemma with three simple strategies. According to the example, a tit-for-tat (TFT) strategy is found to be the best strategy when we evaluate it by the adaptive measure, even if an All-D (always defect) strategy achieves the highest expected payoff. Furthermore, we investigate the adaptive strategies for a self-repairing network consisting of agents with spatial strategies. According to simulations, under some conditions, the strategies obtaining the highest adaptive measures do not correspond to those with the highest averaged resources. The adaptive measure enables us to evaluate the behaviors of the adaptive strategies against those of other strategies. In addition, we discuss some open problems for adaptive strategies.