اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEquivalence between quantum simultaneous games and quantum sequential games
122
0
0.0
(
0
)
تأليف
Naoki Kobayashi
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A framework for discussing relationships between different types of games is proposed. Within the framework, quantum simultaneous games, finite quantum simultaneous games, quantum sequential games, and finite quantum sequential games are defined. In addition, a notion of equivalence between two games is defined. Finally, the following three theorems are shown: (1) For any quantum simultaneous game G, there exists a quantum sequential game equivalent to G. (2) For any finite quantum simultaneous game G, there exists a finite quantum sequential game equivalent to G. (3) For any finite quantum sequential game G, there exists a finite quantum simultaneous game equivalent to G.
قيم البحث
اقرأ أيضاً
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding mathematical q
uestion, is to understand the conditions under which a classical game-theoretic setting can be transformed to a quantum game, and under which conditions there is an equivalence. In this paper, we consider quantum games as those that allow non-factorizable probabilities. We discuss two approaches for obtaining a non-factorizable game and study the outcome of such games. We demonstrate how the standard version of a quantum game can be analyzed as a non-factorizable game and determine the limitations of our approach.
In a two-stage repeated classical game of prisoners dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the players deci
de to cooperate in the first stage while knowing that both will defect in the second.
We study two forms of a symmetric cooperative game played by three players, one classical and other quantum. In its classical form making a coalition gives advantage to players and they are motivated to do so. However in its quantum form the advantag
e is lost and players are left with no motivation to make a coalition.
In this work we study rank-one quantum games. In particular, we focus on the study of the computability of the entangled value $omega^*$. We show that the value $omega^*$ can be efficiently approximated up to a multiplicative factor of 4. We also stu
dy the behavior of $omega^*$ under the parallel repetition of rank-one quantum games, showing that it does not verify a perfect parallel repetition theorem. To obtain these results, we first connect rank-one games with the mathematical theory of operator spaces. We also reprove with these new tools essentially known results about the entangled value of rank-one games with one-way communication $omega_{qow}$. In particular, we show that $omega_{qow}$ can be computed efficiently and it satisfies a perfect parallel repetition theorem.
In evolutionary game theory an Evolutionarily Stable Strategy (ESS) is a refinement of the Nash equilibrium concept that is sometimes also recognized as evolutionary stability. It is a game-theoretic model, well known to mathematical biologists, that
was found quite useful in the understanding of evolutionary dynamics of a population. This chapter presents an analysis of evolutionary stability in the emerging field of quantum games.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
