The aim of this paper is to discuss in some detail the two different quantum schemes for duopoly problems. We investigate under what conditions one of the schemes is more reasonable than the other one. Using the Cournot’s duopoly example, we show that the current quantum schemes require a slight refinement so that they output the classical game in a particular case. Then, we show how the amendment changes the way of studying the quantum games with respect to Nash equilibria. Finally, we define another scheme for the Cournot’s duopoly in terms of quantum computation.
Quantum Information Processing – Springer Journals
Published: Nov 3, 2015
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud