Skip to main content
Log in

Simulation of the quantum Bertrand–Edgeworth game

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

In the Bertrand–Edgeworth duopoly game, two players compete in price to capture the market demand of a uniform product. The game is studied from a general perspective, so that players with different production costs and capacity constraints as well as the two more important rules dealing with unsatisfied demand (proportional and efficient) are taken into consideration. A quantization scheme is applied to the game with the aim of improving the results compared to the classic game. The quantum Bertrand–Edgeworth duopoly game is studied in this work via spatial numerical simulation, supporting the results analytically when it is possible. In this context, it is found that high entanglement induces a Pareto optimal solution ruled by the lower capacity of the players. The way in which the players’ entanglement acts in the game is examined through simulation, paying special attention to the critical value of entanglement from which the Pareto optimal solution emerges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Data availability

Data sharing is not applicable to this article as no external datasets were used during the current study and the outputs from the simulations are available through the figures.

Notes

  1. The explanation of the physical, i.e. quantum, foundation of the entanglement formulas in Eq. (6) is omitted in this study for the sake of conciseness. Such foundation is, of course, provided in the seminal reference [14]. Anyway, the reader might consider the entanglement formulas in a purely classic context, as if they were being stated by an external judge or referee. The authors of the seminal article [14] warn against such a classic view. Nevertheless, in a later article [6] said authors somehow claims it, by identifying the judge with the government’s control, that -needs to improve economic efficiency- and -finally gives the quantities that the two firms should produce-. Anyway, economic efficiency from the perspective of the firms, not of the consumer. A broader perspective taking into account the consumer surplus has been adopted in [19] regarding the Cournot game. We plan to study via simulation such a socially concerned approach that takes into account both the interests of the firms and those of the consumers in the context of the Bertrand–Edgeworth game in a further work.

  2. Equation (6) may be rewritten to as,

    But the \(e^{\gamma }\) factor is not to be eliminated from Eq. (4): it is compulsory in the LDM quantum protocol. Other quantization schemes do exist with the linear convex structure,

    Among these q-protocols with weights adding the unity it stands out the Frackiewicz protocol [8] where \(\omega (\gamma )=\cos ^2{\gamma }\), \(\gamma \in [0,\pi /4]\). This entanglement based in trigonometric instead of in hyperbolic functions very much differ from the implemented in the LDM protocol. This is so because according to Eq. (5) it is \(p^c_1+p^c_2=p_1+p_2\).

  3. The reference [13] studies the problem of the existence of NE in the capacity symmetric BE game with efficient rationing rule and zero marginal cost

  4. As the entangled prices differ in \(\epsilon \) to be considered as equal and the independent prices must satisfy Eq. (8) in \(\gamma ^\cdot \), it can be stated that the price of one of them, e.g. player 2, verifies \(p_2=((a+c)/2)e^{-\gamma }\) and then the other one becomes \(p_1{=}p_2-\epsilon e^\gamma \). Thus, \(p_1^c=\frac{a+c}{2}- \epsilon \frac{e^{2\gamma }+1}{2}\). At the critical entanglement \(g^\cdot \) it will be, \((p_1^c-c)k=\frac{(a-c)^2}{8} \rightarrow \) \(\frac{a-c}{2}- \epsilon \frac{e^{2\gamma }+1}{2}=\frac{(a-c)^2}{8k} \rightarrow \) \((a-c)- \frac{(a-c)^2}{4k} =\epsilon (e^{2\gamma }+1)\). Incidentally, the \(\gamma ^\cdot \) landmark found here is fairly similar to that found in the simulations of the (\(a=10,c=1\))-QBD game with no capacity restrictions reported in [2]. Further analysis on how the \(\gamma \)-threshold values emerge in the implemented simulation is given in the—Response to a PO-player—section in Appendix.

  5. \((\overline{p_1},\overline{p_2},\overline{q_1},\overline{q_2},\overline{u_1},\overline{u_2})\)=(2.911,3.346,4.624,2.334,8.824,5.300)\(_I\), (2.982,3.241,4.245,2.695,8.411,5.856)\(_{II}\), (3.118, 3.050,3.459,3.456,7.328,7.086)\(_{III}\), (3.058,2.967,3.451,3.622,6.422,7.124)\(_{IV}\), (2.969,3.112,4.253,2.734,8.374,5.681)\(_{V}\) .

  6. \((\overline{p_1},\overline{p_2},\overline{q_1},\overline{q_2},\overline{u_1},\overline{u_2})\)=(5.347,4.147,3.062,1.975,13.244,6.215)\(_I\),(5.479,4.047,3.003,1.999,13.444,

    6.091)\(_{II}\),(4.710,4.128,4.002,1.500,14.074,4.692)\(_{III}\), (4.997,3.913,3.364,1.995,13.291,5.810)\(_{IV}\),

    (5.390,4.026,3.075,1.992,13.467,6.027)\(_{V}\) .

  7. In which case \(p_1^c=p^\cdot - \epsilon \frac{e^{2\gamma }+1}{2}\), \(p_2^c=p^\cdot - \epsilon \frac{e^{2\gamma }-1}{2}\) , so that \(p_2^c-p_1^c=-\epsilon \frac{e^{2\gamma }-1}{2} +\epsilon \frac{e^{2\gamma }+1}{2} =\epsilon \).

  8. It is \(p_1^c=\frac{a+c}{2}- \epsilon \frac{e^{2\gamma }+1}{2}\). Thus, \(a-p_1^c=k \rightarrow \) \(2a-2k=a+c- \epsilon (e^{2\gamma }+1) \rightarrow \) \(\epsilon e^{2\gamma }=c-(a-2k)-\epsilon \) .

  9. \(u_1=10.125\), \(u_2=8.970\) in Fig. 17a and \(u_1=10.125\), \(u_2=6.970\) in Fig. 17a; in both cases from \(p_1=p_2=5.485\), \(q_1=q_2=2.258\).

  10. \(p_1{=}5.251, p_2{=}2.625, q_1{=}3.461, q_2{=}2.000, u_1{=}14.713, u_2{=}3.251\), where \(d_2{=}D_2{=}10{-}2.625{=}7.375\) and \(q_2{=}2\), so that \((D_2{-}k_2)/D_2{=}(7.375{-}2)/7.375{=}0.729\), and as a result \(q_1{=}r_1{=}(D_1{=}10{-}5.251)0.729{=}3.461\). In the \(p_2{=}p_1/2\) scenario of Fig. 17a, \(u_2{=}(p_2{-}1.0)k_2\ge 0.0\rightarrow 1.0\le p_2\le 5.0\), so that \(4.0\le d_1{=}(10{-}p_2)\le 9.0\rightarrow k_2{=}2.0\), and as a result, \(u_2{=}(p_2{-}1.0)2.0{=}(p_1/2{-}1.0)2.0{=}(p_1{-}2),\, 2\le p_1\le 10\); thus \(u^{\text {max}}_2{=}10{-}2=8\), \(u^{\text {min}}_2{=}10{-}10=0\). In turn, \(u_1{=}(p_1{-}1)\big ((10{-}p_1)(\frac{8{-}p_1/2}{10{-}p_1/2})\big ),\, 2\le p_1\le 10\).

References

  1. Allen, B., Hellwig, M.: Bertrand–Edgeworth duopoly with proportional residual demand. Int. Econ Rev, 39-60 (1993)

  2. Alonso-Sanz, R., Adamatzky, A.: Spatial simulation of the quantum Bertrand duopoly game. Phys. A 557, 124867 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alonso-Sanz, R.: Quantum Game Simulation. Springer, Berlin (2019)

    Book  MATH  Google Scholar 

  4. Bertrand, J.: Theorie mathematique de la richesse sociale. J. des Savants 67, 499–508 (1883)

    Google Scholar 

  5. Deneckere, R.J., Kovenock, D.: Bertrand–Edgeworth duopoly with unit cost asymmetry. Econ. Theor. 8(1), 1–25 (1996)

    Article  MATH  Google Scholar 

  6. Du, J., Ju, C., Li, H.: Quantum entanglement helps in improving economic efficiency. J. Phys. A: Math. General 38(7), 1559 (2005)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  7. Edgeworth, F.Y.: Papers relating to political economy I, 111-142. Royal economic society by Macmillan and Company, Limited (1925)

  8. Frackiewicz, P.: Remarks on quantum duopoly schemes. Quantum Inf. Process. 15(1), 121–136 (2016)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  9. Frackiewicz, P., Sladkowski, J.: Quantum approach to Bertrand duopoly. Quantum Inf. Process. 15(9), 3637–3650 (2016)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  10. Garcia-Perez, L., et al.: The quantum Hotelling–Smithies game. Quantum Inf. Process. 28(1), 38 (2023)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  11. Gibbons, R.: Game Theory for Applied Economists. Princeton University Press, Princeton (1992)

    Book  Google Scholar 

  12. Iskakov, A.B., Iskakov, M.B.: Equilibria in secure strategies in the Bertrand–Edgeworth duopoly. Autom. Remote. Control. 77(12), 2239–2248 (2016)

    Article  MATH  Google Scholar 

  13. Levitan, R., Shubik, M.: Price duopoly and capacity constraints. Int. Econ. Rev. 13, 111–122 (1972)

    Article  MATH  Google Scholar 

  14. Li, H., Du, J., Massar, S.: Continuous-variable quantum games. Phys. Lett. A 306, 73–78 (2002)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  15. Lo, C.F., Kiang, D.: Quantum Bertrand duopoly with differentiated products. Phys. Lett. A 321(2), 94–98 (2004)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  16. Qin, G., Chen, X., Sun, M., Zhou, X., Du, J.: Appropriate quantization of asymmetric games with continuous strategies. Phys. Lett. A 340(1–4), 78–86 (2005)

    Article  MATH  ADS  Google Scholar 

  17. Sekiguchi, Y., Sakahara, K., Sato, T.: Existence of equilibria in quantum Bertrand-Edgeworth duopoly game. Quantum Inf. Process. 11(6), 1371–1379 (2012)

    Article  MathSciNet  MATH  ADS  Google Scholar 

  18. Vives, X.: Oligopoly Pricing: Old Ideas and New Tools. MIT press, Cambridge (1999)

    Google Scholar 

  19. Wang, N., Yang, Z.: Quantum mixed duopoly games with a nonlinear demand function. Quantum Inf. Process. 22(3), 139 (2023)

    Article  MathSciNet  MATH  ADS  Google Scholar 

Download references

Acknowledgements

Work funded by the Spanish Grant PID2021-122711NB-C21. The computations of this work were performed in FISWULF, an HPC machine of the Int. Campus of Excellence of Moncloa.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ramon Alonso-Sanz.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

This Appendix aims to support the rationale behind the results emerging in the simulations of the symmetric game reported in Fig. 1.

1.1 Dynamics

Figure 13 shows the dynamics of the average over the lattice of prices, sales and payoffs in a simulation of the symmetric QBE (\(a=10,c=1,k=5\)) game with proportional rationing rule. In the \(\gamma =0.0\) classic scenario of Fig. 13a, the average prices of both players heavily decrease from the initial \(p=5.0\) in the first iterations and very smoothly afterwards, so that at \(T=200\) both average prices look stabilized at values \(\overline{p}_1=2.911\), \(\overline{p}_2=3.346\). The average sales are also stable at \(T=200\) with \(\overline{d}_1=4.624\), \(\overline{d}_2=2.334\). The average payoff of player 2 decreases from the first iterations down to its stabilization around \(T=100\) in a fairly uniform way, being \(\overline{u}_2=5.300\) at \(T=200\). The average payoff of player-1 initially decreases but soon inverts this trend and commences to grow, so that from approximately \(T=35\) it is \(\overline{u}_1 > \overline{u}_2\), with stabilization of \(\overline{u}_1\) also around \(T=100\) and \(\overline{u}_1(T=200)=8.824\). The standard deviations of the payoffs also appear stabilized from approximately \(T=100\) down to low values lower than 0.5. The findings just reported in a particular example have general validity. Thus, the studied classic dynamical system can be considered as stationary at \(T=200\) (as it is in the particular case of Fig. 13a), further iterations alter the average values reported at \(T=200\) in a negligible extent. Remarkably, the simulation does not converge in the classic game to the \(p_{1,2}=c=1.0\) NE but to higher and unequal prices.

Fig. 13
figure 13

Dynamics of the average prices (\(\overline{p}\)), sales (\(\overline{q}\)) and payoffs (\(\overline{u}\)) in a simulation of the symmetric QBE (\(a{=}10,c=1,k=5\)) game. Proportional rationing rule. a \(\gamma =0.0\). b \(\gamma =5.0\)

In the \(\gamma =5.0\) simulation of Fig. 13b, the results regarding both players are virtually coincident, so that the red colour graphs apply not only for player-1 but also for player-2. Both average independent prices smoothly decrease from 5.0 down to very small values before \(T=50\), and in parallel to this the average sales smoothly increase up to circa 2.25. The average entangled prices are so high in the initial time-steps that they are represented only from \(T=35\). But from then on, the dramatic decreasing of the average entangled prices makes feasible their representation. In fact both entangled prices plummet down to \(\overline{p^c}\simeq 5.5\) before \(T=50\). The standard deviations of the prices slightly increase in the first iterations, but from approximately \(T=15\) smoothly decrease, becoming zero soon before \(T=40\). The standard deviations of the payoffs also become small at \(T=50\), but show an unexpected parabolic aspect before this time-step.

The mean-field sales and payoffs (\(q^\#\),\(u^\#\)) of both players coincide in Fig. 13b, so that only a somehow green+brown line labelled \(u_1^\#\,u_2^\#\) may be appreciated with low T. The huge values of the mean-field entangled prices up to \(T=35\), of course higher than \(a=10\), induce zero mean-field payoff, but at \(T=36\) the mean-field entangled prices decrease enough for the mean-field payoffs to take off and rocket from \(p^\#(36)=0.116\) up to \(p^\#(39)=10.021\). For higher time-steps the mean-field payoffs and the actual average payoffs virtually coincide.

The difficulties of the implemented simulation reported in Fig. 13a when dealing with a classic BE game with \(k=5>2.25=(a-c)\) vanish in games with \(k<(a-c)\). So, for example in the particular case of \(k=2.0 <2.25\) considered in Fig. 14. The dynamics in Fig. 14a leads very quickly to reaching the expected values: \(q_{1,2}=k=2\), \(p_{1,2}=10-4=6\), \(u_{1,2}=(6-1)2=10\). This \(q_{1,2}=k\) solution cannot be improved, so that entangling the players has no positive effect. Thus, in Fig. 14b, both players still get \(u^c_{1,2}=10\) from \(q^c_{1,2}=2\), \(p^c_{1,2}=6\), which arises from \(p_{1,2}=6e^{-\gamma }\).

Fig. 14
figure 14

Average prices (\(\overline{p}\)), sales (\(\overline{q}\)) and payoffs (\(\overline{u}\)) in a simulation of the symmetric QBE (\(a{=}10,c=1,k=2\)) game. Proportional rationing rule. a Dynamics up to \(T=20\) with \(\gamma =0.0\). b Average values at \(T=100\) with variable \(\gamma \)

1.2 Response to a PO-player

Figure 15 describes the player-1 response in the simulation of a symmetric QBE game with proportional rationing rule when the price of all the cells of player-2 are fixed to \(p_2(\gamma )=((a+c)/2)e^{-\gamma }\) . In Fig. 15a, only the red colour from player-1 looks appreciable in the p-plots, whereas the blue colour from player-2 is masked by the red colour, i.e. apparently the prices of both players are equal regardless of \(\gamma \). But this is not so before \(\gamma ^\blacktriangledown =3.453\), where \(\overline{d^c}=\overline{p^c_2} -\overline{p^c_1} > \epsilon =0.001\), and consequently the player-1 wins the game and gets the maximum payoff attainable, whereas player-2 gets no demand and consequently zero payoff, as it is shown in Fig. 15b. Note that \(\gamma ^\blacktriangledown =3.453\) is very close over \(\gamma ^\blacktriangle =3.280\), the lower \(\gamma \)-landmark in Fig. 1 . The numerical values of the average prices, sales, payoffs and \(\overline{d^c}\) for \(\gamma =0.0, 1.0, 2.0, 3.0\) are shown in Table 2.

Fig. 15
figure 15

The QBE (\(a{=}10,c=1,k=5\)) symmetric game in a simulation at T=200 . Player-1 updates the price, \(p_2(\gamma )=((a+c)/2)e^{-\gamma }\). Variable entanglement \(\gamma \) . Proportional rationing rule. a Average independent and entangled prices (\(\overline{p},\overline{p^c}\)), and sales (\(\overline{q^c})\). b Average payoffs (\(\overline{u^c}\))

From \(\gamma ^\cdot =4.253\) onwards, it is \(\overline{d^c} < \epsilon =0.001\) in Fig. 15, so that both players share the demand and reach the PO solution in Fig. 1 . Table 2 gives the exact numerical values of the average prices, sales and payoffs for \(\gamma =5.0\) and \(\gamma =6.0\), both greater than \(\gamma ^\cdot \), where in fact the entangled prices of both players are equal up to the fifth decimal place. Incidentally, when approaching \(\gamma =3.0\), the entangled prices decrease from the 5.5-plateau in Fig.15a; associated with this, the mean-field payoffs fairly coincide with the actual average payoffs in Fig. 1. At \(\gamma =4.0\in [\gamma ^\blacktriangledown ,\gamma ^\cdot ]\) it is \(\overline{q}_1=5.0=k>d^\cdot \) and \(\overline{q}_2=1.0151\), with very close entangled prices providing the payoffs reported in Table 2, which indicate the drift to the PO solution with high \(\gamma > 4.0\). In a simulation analogue to that in Fig. 15 but with the efficient rule, player-2 also gets positive average sale from circa \(\gamma ^\blacktriangledown \).

Table 2 Numerical values of prices, sales and payoffs in the simulation of Fig.15

Values of \(\epsilon \) smaller than 0.001 would delay the emergence of \(\gamma ^\blacktriangledown \) and \(\gamma ^\cdot \) in the scenario of Fig. 15, whereas both \(\gamma \) landmarks will decrease with higher values of \(\epsilon \). Thus, for example, in the \(\epsilon =0.1\) simulation of Fig. 16, it is \(\gamma ^\blacktriangledown = 1.099\) and \(\gamma ^\cdot =1.941\). In Fig. 16a, it becomes apparent that before \(\gamma ^\cdot \) the prices of player-1 (both independent and entangled) are below of those of player-2.

Fig. 16
figure 16

The QBE (\(a{=}10,c{=}1,k{=}5\)) symmetric game in a simulation with \(\epsilon {=}0.1\) at T=200 . Player-1 updates the price, \(p_2(\gamma ){=}((a+c)/2)e^{-\gamma }\). Variable entanglement \(\gamma \) . Proportional rationing rule. a Average independent and entangled prices (\(\overline{p},\overline{p^c}\)) and sales (\(\overline{q^c})\). b Average payoffs (\(\overline{u^c}\))

In Figs. 15, 16, the response to \(p_2{=}p^\cdot (\gamma ){=}((a+c)/2)e^{-\gamma }\) virtually becomes \(p_1{=}p_2-\epsilon e^\gamma \) Footnote 7, up to the \(\gamma ^\cdot \) entanglement value from which the PO solution is reached. The value of \(\gamma ^\cdot \) was given in Eq. (10) provided that \(k>(a-c)/4\). Note that the \(\gamma ^\cdot \) landmark decreases with the increase of \(\epsilon \). and converges to \(\frac{1}{2}\ln \big ( \frac{a-c}{\epsilon }-1\big )\) when k grows. Accordingly to this, with \(a=10,c=1\) the \(\gamma ^\cdot \) landmark converges with high k to \(\gamma ^\cdot (\epsilon =0.001)=4.552\) and \(\gamma ^\cdot (\epsilon =0.1)=2.244\). The \(\gamma ^\blacktriangledown \) entanglement value from which the player-1 sells its maximum production capacity k is given in Eq. (17)Footnote 8, provided that \(k>(a-c)/2\) so that \(c-(a-2k)>0\). Incidentally, \(p_1{=}p_2-\epsilon e^\gamma \) is not negative up to \(\gamma ^+=\frac{1}{2}\ln \big (\frac{a+c}{2\epsilon }\big )\). It is \(\gamma ^+=4.306\) in Fig. 15 and \(\gamma ^+=2.004\) in Fig. 16 close over the corresponding \(\gamma ^\cdot \) values. Last but least, both \(\gamma ^\blacktriangledown \) and \(\gamma ^\cdot \) diverge as \(\epsilon \) goes to zero.

$$\begin{aligned} \gamma ^\blacktriangledown =\frac{1}{2}\ln \left( \frac{c-(a-2k)}{\epsilon }-1\right) \end{aligned}$$
(17)

1.3 Payoff region

Figure 17 shows the non-negative payoffs region in the BE (\(a=10,k_1=5,k_2=2,c_1=1\)) game with proportional rationing rule. Both price values have been sampled in 100 points advancing from 0 up to 10 with a 10/100 increment, which explains the mottled (or discrete) aspect of the payoffs regions. The red-marked solutions denote the payoffs when \(p_1=p_2\), whereas the blue-marked solutions denote the payoffs when \(p_2=p_1/2\). The bullet-marked points indicate the location of the points with maximum payoff of the two-players, with that one in the border of the payoff region, i.e. a PO solution, box-framed.

In the \(p_1=p_2\) scenario, the solution with maximum payoff of the player-2 is located in the border of the payoff region in the two scenarios of Fig. 17, so that they are PO solutions. These solutions are induced by entanglement in Fig.3 regarding Fig. 17a, i.e. \(u_1{=}u_2{=}10.0\), and in Fig.6 regarding Fig. 17b, i.e. \(u_1{=}10.0\), \(u_2{=}8.0\); in both scenarios with \(p_1{=}p_2{=}6.0\), \(q_1{=}q_2{=}2.0\). In the two games of Fig. 17, the solutions corresponding to the player-1 in the \(p_1=p_2\) scenarioFootnote 9 are not located in the border of the payoff region, thus there is room for the increase of the payoffs of both players, that is, they are not PO solutions.

In the \(p_2{=}p_1/2\) scenario, the solution with maximum payoff of the player-1 is a proper PO solution in Fig. 17aFootnote 10 and an almost-PO solution in Fig. 17b. These solutions are much more payoff-unbalanced than those reached with \(p_1{=}p_2\).

Fig. 17
figure 17

Non-negative payoffs region in the BE (\(a=10,k_1=5,k_2=2,c_1=1\)) game with proportional rationing rule. The red-marked solutions denote the payoffs when \(p_1=p_2\). The blue-marked solutions denote the payoffs when \(p_2=p_1/2\). a \(c_2=1.0\). b \(c_2=2.0\)

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grau-Climent, J., Garcia-Perez, L., Losada, J.C. et al. Simulation of the quantum Bertrand–Edgeworth game. Quantum Inf Process 22, 411 (2023). https://doi.org/10.1007/s11128-023-04163-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-023-04163-2

Keywords

Navigation