2020/05/11 by Amit Anand, Bikash K. Behera, Prasanta K. Panigrahi
Computer Science · Physics and Astronomy · #Dilemma #IBM #Nash equilibrium #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum circuit #Quantum computer #Stochastic game #Superposition principle #quant-ph
paper · pdf · doi:10.1007/s11128-020-02687-5
published as Quantum Information Processing 19, 186 (2020)
openalex publication_date 2020/05/11 · openalex created_date 2020/05/21 · arxiv created 2020/11/16 · arxiv updated 2020/11/17 · openalex updated_date 2026/08/05
Diners dilemma is one of the most interesting problems in both economic and game theories. Here, we solve this problem for n (number of players) =4 with quantum rules and we are able to remove the dilemma of diners between the Pareto optimal and Nash equilibrium points of the game. We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We use the quantum principles of superposition and entanglement that gives supremacy over any classical strategies. We present the circuit implementation for the game, design it on the IBM quantum simulator and verify the strategies in the quantum model.