Experiments with Probabilistic Quantum Auctions
Kay-Yut Chen, Tad Hogg

TL;DR
This paper reports on human-subject experiments with probabilistic quantum auctions, showing that quantum protocols can outperform classical auctions under certain complex economic scenarios, aligning with game theory predictions.
Contribution
It provides experimental validation of quantum auction protocols and compares their performance with classical auctions, highlighting conditions for their advantages.
Findings
Quantum protocols perform better in complex scenarios.
Classical auctions outperform quantum ones in simple settings.
Quantum auctions require complex economic contexts to show benefits.
Abstract
We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in determining which bidder wins, or having no winner, rather than always having the highest bidder win. Comparing two quantum protocols in the context of first-price sealed bid auctions, we find the one predicted to be superior by game theory also performs better experimentally. We also compare with a conventional first price auction, which gives higher performance. Thus to provide benefits, the quantum protocol requires more complex economic scenarios such as maintaining privacy of bids over a series of related auctions or involving allocative externalities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
