# Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator

Source: [Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator](<https://www.sota2.com/research/paper/68fa3d851e209131ce8e0e83>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T01:33:04.015Z

Authors: Amit Anand, Bikash K. Behera, Prasanta K. Panigrahi

Published: 2020-10-24T08:49:28.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2010.12841>)

[PDF](<https://arxiv.org/pdf/2010.12841.pdf>)
