Quantum Tapsilou—A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- 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.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.- Jehiel, Philippe, 2005.
"Analogy-based expectation equilibrium,"
Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
- Philippe Jeniel, 2001. "Analogy-Based Expectation Equilibrium," Economics Working Papers 0003, Institute for Advanced Study, School of Social Science.
- Philippe Jehiel, 2005. "Analogy-Based Expectation Equilibrium," Levine's Bibliography 784828000000000106, UCLA Department of Economics.
- Philippe Jehiel, 2005. "Analogy-based Expectation Equilibrium," Post-Print halshs-00754070, HAL.
- Beal, Sylvain & Querou, Nicolas, 2007.
"Bounded rationality and repeated network formation,"
Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
- Beal, Sylvain & Querou, Nicolas, 2006. "Bounded Rationality and Repeated Network Formation," Coalition Theory Network Working Papers 12169, Fondazione Eni Enrico Mattei (FEEM).
- Sylvain Béal & Nicolas Quérou, 2007. "Bounded rationality and repeated network formation," Post-Print ujm-00162449, HAL.
- Nicolas Querou & Sylvain Beal, 2006. "Bounded Rationality and Repeated Network Formation," Working Papers 2006.74, Fondazione Eni Enrico Mattei.
- Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
- Hernández, Penélope & Solan, Eilon, 2016.
"Bounded computational capacity equilibrium,"
Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
- Eilon Solan & Penélope Hernández, 2014. "Bounded Computational Capacity Equilibrium," Discussion Papers in Economic Behaviour 0314, University of Valencia, ERI-CES.
- 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.
- Hernández, Penélope & Urbano, Amparo, 2008.
"Codification schemes and finite automata,"
Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
- Amparo Urbano Salvador & Penélope Hernández Rojas, 2000. "Codification schemes and finite automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- 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.
- 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).
- Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
- Spiegler, Ran, 2005.
"Testing threats in repeated games,"
Journal of Economic Theory, Elsevier, vol. 121(2), pages 214-235, April.
- Ran Spiegler, 2001. "Testing Threats in Repeated Games," Economics Working Papers 0009, Institute for Advanced Study, School of Social Science.
- Ran Spiegler, 2002. "Testing Threats in Repeated Games," NajEcon Working Paper Reviews 391749000000000445, www.najecon.org.
- Ran Spiegler, 2002. "Testing Threats in Repeated Games," Levine's Working Paper Archive 391749000000000445, David K. Levine.
- Spiegler, R., 2001. "Testing Threats in Repeated Games," Papers 2001-28, Tel Aviv.
- Anderlini, Luca, 1999.
"Communication, Computability, and Common Interest Games,"
Games and Economic Behavior, Elsevier, vol. 27(1), pages 1-37, April.
- Anderlini, L., 1990. "Communication, Computability And Common Interest Games," Papers 159, Cambridge - Risk, Information & Quantity Signals.
- Luca Anderlini, 1995. "Communication, Computability and Common Interest Games," Game Theory and Information 9510003, University Library of Munich, Germany.
- 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.
- Yuan Gu & Chao Hung Chan, 2024. "Complexity Aversion," Papers 2406.18463, arXiv.org.
- Monte, Daniel, 2014. "Learning with bounded memory in games," Games and Economic Behavior, Elsevier, vol. 87(C), pages 204-223.
- Compte, Olivier & Postlewaite, Andrew, 2015.
"Plausible cooperation,"
Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," Post-Print halshs-01204780, HAL.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," PSE-Ecole d'économie de Paris (Postprint) halshs-01204780, HAL.
- 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.
- 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.
- Olivier Gossner & Penélope Hernández, 2003.
"On the Complexity of Coordination,"
Mathematics of Operations Research, INFORMS, vol. 28(1), pages 127-140, February.
- O. Gossner & P. Hernandez, 2001. "On the complexity of coordination," THEMA Working Papers 2001-21, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- GOSSNER, Olivier & HERNANDEZ, Pénélope, 2001. "On the complexity of coordination," LIDAM Discussion Papers CORE 2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
More about this item
Keywords
classical games; quantum games; quantum coin tossing games; quantum strategies;All these keywords.
Statistics
Access and download statisticsCorrections
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.