اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Cooperative Games
68
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 advantage is lost and players are left with no motivation to make a coalition.
قيم البحث
اقرأ أيضاً
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.
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.
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.
We consider two aspects of quantum game theory: the extent to which the quantum solution solves the original classical game, and to what extent the new solution can be obtained in a classical model.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
