Quantum Keynesian Beauty Contest with Continuous Variables

The development of quantum computing has opened up opportunities to re-explore conventional game models by the integration of quantum processes. Through the established framework of quantum game theory, we examine the problem of speculative pricing in the Keynesian Beauty Contest model -- the $p$-Beauty Contest ($p$-BC). In the $p$-BC, players are rewarded with the optimal payoff for successfully bidding at some fraction $p$ of the average of all of the players' bids. Consequently, \textit{rational} plays in the $p$-BC inexorably lead to boom or bust strategies for $p>1$ or $p<1$ respectively. We demonstrate a quantum continuous-variable implementation of $p$-BC where the boom-and-bust rational behavior is mitigated through a global transformation of the players' bids generated by increasing multimode squeezing. While we focus on a quantum mechanical implementation of the $p$-BC, we show that an entirely analogous game can be formulated via classical channels by a global mediator. Thus we identify global mediation as the underlying game-theoretic mechanism for quenching boom and bust phenomena in our model. We analyze the quantum $p$-BC for two, three, and many players in a mean-field type implementation. We derive an analytical form for the probability distribution of the payoff under single-value measurements of the quantum processing circuit, and explore how the rational behavior differs from the expected-value measurement setting.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16829
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantum Keynesian Beauty Contest with Continuous Variables

Kieran Hymas, James Q. Quach, Derek Abbott, Kareem Raslan et al.
arXiv (Cornell University)
Quantum Information and Cryptography
preprint

Quantum Keynesian Beauty Contest with Continuous Variables

Kieran Hymas, James Q. Quach, Derek Abbott, Kareem Raslan, Andrew D. Greentree, Hiu Ming Lau, Azhar Iqbal, Qiang Sun
preprint en

Abstract

The development of quantum computing has opened up opportunities to re-explore conventional game models by the integration of quantum processes. Through the established framework of quantum game theory, we examine the problem of speculative pricing in the Keynesian Beauty Contest model -- the $p$-Beauty Contest ($p$-BC). In the $p$-BC, players are rewarded with the optimal payoff for successfully bidding at some fraction $p$ of the average of all of the players' bids. Consequently, \textit{rational} plays in the $p$-BC inexorably lead to boom or bust strategies for $p>1$ or $p<1$ respectively. We demonstrate a quantum continuous-variable implementation of $p$-BC where the boom-and-bust rational behavior is mitigated through a global transformation of the players' bids generated by increasing multimode squeezing. While we focus on a quantum mechanical implementation of the $p$-BC, we show that an entirely analogous game can be formulated via classical channels by a global mediator. Thus we identify global mediation as the underlying game-theoretic mechanism for quenching boom and bust phenomena in our model. We analyze the quantum $p$-BC for two, three, and many players in a mean-field type implementation. We derive an analytical form for the probability distribution of the payoff under single-value measurements of the quantum processing circuit, and explore how the rational behavior differs from the expected-value measurement setting.

arXiv (Cornell University)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon