纠缠和量子策略降低Pigou网络的拥塞代价
Entanglement and quantum strategies reduce congestion costs in Pigou networks
摘要:
Pigou问题在现实生活中有许多应用,如交通网络,图论,互联网网络中的数据传输等。两个玩家的经典Pigou网络具有唯一的纳什均衡,稳定价格和无政府价格彼此一致。对于$k-$人,情况发生了变化,经典的庇古网络中$n$是总人数。如果我们固定$(n-2)$人的行为,并假设$k-$人选择路径$P_2$,其中$k<(n-2)$和其他人选择路径$P_1$,纳什均衡的最小成本就变成了$k$相关的,我们找到了一个特定的$k$,它的成本是绝对最小的。与经典的两人Pigou网络相比,具有最大纠缠度的量子两比特Pigou网络的纳什均衡代价更低,而与经典的$k-$人Pigou网络相比,量子两比特Pigou网络的纳什均衡代价更低.这对经典和量子数据网络中的信息传输都有重大影响。通过使用纠缠和量子策略,可以显着降低量子数据网络中的拥塞成本。
英文摘要:
Pigou's problem has many applications in real life scenarios like traffic networks, graph theory, data transfer in internet networks, etc. The two player classical Pigou's network has an unique Nash equilibrium with the Price of Stability and Price of Anarchy agreeing with each other. The situation changes for the $k-$person classical Pigou's network with $n$ being the total number of people. If we fix the behaviour of $(n-2)$ people and assume that $k-$persons take path $P_2$ where $k<(n-2)$ and the remaining take path $P_1$, the minimum cost of Nash equilibrium becomes $k$ dependent and we find a particular $k$ for which the cost is an absolute minimum. In contrast to the two person classical Pigou's network, the quantum two qubit Pigou's network with maximal entanglement gives a lower cost for the Nash equilibrium, while in contrast to $k-$person classical Pigou's network, it's quantum version gives reduced cost for the Nash equilibrium strategy. This has major implications for information transfer in both classical as well as quantum data networks. By employing entanglement and quantum strategies, one can significantly reduce congestion costs in quantum data networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。