IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v14y2023i6p72-d1284009.html
   My bibliography  Save this article

Quantum Tapsilou—A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou

Author

Listed:
  • Kalliopi Kastampolidou

    (Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece
    These authors contributed equally to this work.)

  • Theodore Andronikos

    (Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece
    These authors contributed equally to this work.)

Abstract

This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important characteristic of the traditional game. In the classical game, both players have 1 4 probability to win. The quantum version retains this characteristic feature, which is that both players have the same probability to win, but only now this probability varies considerably and depends on previous moves and choices. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement via the use of rotation gates instead of Hadamard gates, which generates Bell-like states with unequal probability amplitudes, and the integral use of groups. In Quantum Tapsilou both players agree on a specific cyclic rotation group of order n , for some sufficiently large n . The game is based on the chosen group, in the sense that both players will draw their moves from its elements. More specifically, both players will pick rotations from this group to realize their actions using the corresponding R y rotation gates. In the Quantum Tapsilou game, it is equally probable for both players to win. This fact is in accordance with a previous result in the literature showing that quantum games where both players choose their actions from the same group, exhibit perfect symmetry by providing each player with the possibility to pick the move that counteracts the other player’s action.

Suggested Citation

  • Kalliopi Kastampolidou & Theodore Andronikos, 2023. "Quantum Tapsilou—A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou," Games, MDPI, vol. 14(6), pages 1-20, November.
  • Handle: RePEc:gam:jgames:v:14:y:2023:i:6:p:72-:d:1284009
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/14/6/72/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2073-4336/14/6/72/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    2. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    3. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Theodore Andronikos & Alla Sirokofskich, 2024. "A Multiparty Quantum Private Equality Comparison Scheme Relying on | GHZ 3 〉 States," Future Internet, MDPI, vol. 16(9), pages 1-27, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jehiel, Philippe, 2005. "Analogy-based expectation equilibrium," Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
    2. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    3. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    4. Hernández, Penélope & Solan, Eilon, 2016. "Bounded computational capacity equilibrium," Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
    5. Eli Ben-Sasson & Adam Tauman Kalai & Ehud Kalai, 2006. "An Approach to Bounded Rationality," Discussion Papers 1439, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. Hernández, Penélope & Urbano, Amparo, 2008. "Codification schemes and finite automata," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
    7. Bavly, Gilad & Peretz, Ron, 2019. "Limits of correlation in repeated games with bounded memory," Games and Economic Behavior, Elsevier, vol. 115(C), pages 131-145.
    8. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    9. Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
    10. Spiegler, Ran, 2005. "Testing threats in repeated games," Journal of Economic Theory, Elsevier, vol. 121(2), pages 214-235, April.
    11. Anderlini, Luca, 1999. "Communication, Computability, and Common Interest Games," Games and Economic Behavior, Elsevier, vol. 27(1), pages 1-37, April.
    12. Westhoff, Frank H. & Yarbrough, Beth V. & Yarbrough, Robert M., 1996. "Complexity, organization, and Stuart Kauffman's The Origins of Order," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 1-25, January.
    13. Yuan Gu & Chao Hung Chan, 2024. "Complexity Aversion," Papers 2406.18463, arXiv.org.
    14. Monte, Daniel, 2014. "Learning with bounded memory in games," Games and Economic Behavior, Elsevier, vol. 87(C), pages 204-223.
    15. Compte, Olivier & Postlewaite, Andrew, 2015. "Plausible cooperation," Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
    16. Amit Pazgal, 1995. "Satisficing Leads to Cooperation in Mutual Interests Games," Discussion Papers 1126, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
    18. Olivier Gossner & Penélope Hernández, 2003. "On the Complexity of Coordination," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 127-140, February.
    19. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    20. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:14:y:2023:i:6:p:72-:d:1284009. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.