Entanglement gives rise to Pareto optimality in the generalised quantum Hawk-Dove Game

TL;DR

This paper quantifies the quantum version of the Hawk-Dove game, demonstrating that entanglement can lead to Pareto optimal and evolutionarily stable strategies, surpassing classical inefficiencies.

Contribution

It introduces a quantum extension of the Hawk-Dove game showing entanglement induces Pareto optimal equilibria.

Findings

Entanglement surpasses a critical threshold to produce Pareto optimal strategies.

Quantum strategies outperform classical ones in the Hawk-Dove game.

Analytical derivation of the entanglement threshold for optimality.

Abstract

We quantise the generalised Hawk-Dove Game. By restricting the strategy space available to the players, we show that every game of this type can be extended into the quantum realm to produce a Pareto optimal evolutionarily stable strategy. This equilibrium replaces the inefficient classical one when the entanglement prepared in the game exceeds a critical threshold value, which we derive analytically.