In this work, we consider an evolutionary prisoner's dilemma game on a homogeneous random network with the richest-following strategy adoption rule. By constructing homogeneous random networks from a regular ring ...In this work, we consider an evolutionary prisoner's dilemma game on a homogeneous random network with the richest-following strategy adoption rule. By constructing homogeneous random networks from a regular ring graph, we investigate the effects of topological randomness on cooperation. In contrast to the ordinary view that the presence of small amount of shortcuts in ring graphs favors cooperation, we find the cooperation inhibition by weak topological randomness. The explanations on the observations are展开更多
This paper investigated how to learn the optimal action policies in cooperative multi-agent systems if the agents’ rewards are random variables, and proposed a general two-stage learning algorithm for cooperative mul...This paper investigated how to learn the optimal action policies in cooperative multi-agent systems if the agents’ rewards are random variables, and proposed a general two-stage learning algorithm for cooperative multi-(agent) decision processes. The algorithm first calculates the averaged immediate rewards, and considers these learned rewards as the agents’ immediate action rewards to learn the optimal action policies. It is proved that the learning algorithm can find the optimal policies in stochastic environment. Extending the algorithm to stochastic Markov decision processes was also discussed.展开更多
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems.Quantum information processing can be used to red...Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems.Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems.We speak of pseudo-telepathy when it is able to completely eliminate the need for communication.Since it is generally very hard to perfectly implement a quantum winning strategy for a pseudo-telepathy game,quantum players are almost certain to make errors even though they use a winning strategy.After introducing a model for pseudotelepathy games,we investigate the impact of erroneously performed unitary transformations on the quantum winning strategy for the Mermin-GHZ game.The question of how strong the unitary noise can be so that quantum players would still be better than classical ones is also dealt with.展开更多
基金Supported by the Project of NECT-07-0112 the National Natural Science Foundation of China under Grant Nos. 10775022 and 90921015
文摘In this work, we consider an evolutionary prisoner's dilemma game on a homogeneous random network with the richest-following strategy adoption rule. By constructing homogeneous random networks from a regular ring graph, we investigate the effects of topological randomness on cooperation. In contrast to the ordinary view that the presence of small amount of shortcuts in ring graphs favors cooperation, we find the cooperation inhibition by weak topological randomness. The explanations on the observations are
文摘This paper investigated how to learn the optimal action policies in cooperative multi-agent systems if the agents’ rewards are random variables, and proposed a general two-stage learning algorithm for cooperative multi-(agent) decision processes. The algorithm first calculates the averaged immediate rewards, and considers these learned rewards as the agents’ immediate action rewards to learn the optimal action policies. It is proved that the learning algorithm can find the optimal policies in stochastic environment. Extending the algorithm to stochastic Markov decision processes was also discussed.
基金supported by the research projects MSM0021622419 and 201/0710603
文摘Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems.Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems.We speak of pseudo-telepathy when it is able to completely eliminate the need for communication.Since it is generally very hard to perfectly implement a quantum winning strategy for a pseudo-telepathy game,quantum players are almost certain to make errors even though they use a winning strategy.After introducing a model for pseudotelepathy games,we investigate the impact of erroneously performed unitary transformations on the quantum winning strategy for the Mermin-GHZ game.The question of how strong the unitary noise can be so that quantum players would still be better than classical ones is also dealt with.
