Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Quantum computation and quantum information
Quantum computation and quantum information
A Quantum Treatment of Public Goods Economics
Quantum Information Processing
Quantum Solution of Coordination Problems
Quantum Information Processing
Combinatorial Auctions
How Well Do People Play a Quantum Prisoner's Dilemma?
Quantum Information Processing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A quantum approach to play asymmetric coordination games
Quantum Information Processing
| Hi-index | 0.00 |
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.