arXiv subjects

Kay-Yut Chen

Publications and source records attributed to Kay-Yut Chen.

5 recordsLinked to original sources

arXiv2008

Experiments with Probabilistic Quantum Auctions

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.

quant-ph↗

arXiv2007

Quantum Auctions

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition. Thus non-winning bids are never revealed. Participants can use entanglement to arrange for correlations among their bids, with the assurance that this entanglement is not observable by others. The protocol is useful for information hiding applications, such as partnership bidding with allocative externality or concerns about revealing bidding preferences. The protocol applies to a variety of auction types, e.g., first or second price, and to auctions involving either a single item or arbitrary bundles of items (i.e., combinatorial auctions). We analyze the game-theoretical behavior of the quantum protocol for the simple case of a sealed-bid quantum, and show how a suitably designed adiabatic search reduces the possibilities for bidders to game the auction. This design illustrates how incentive rather that computational constraints affect quantum algorithm choices.

quant-ph↗

arXiv2003

A Practical Quantum Mechanism for the Public Goods Game

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is difficult to implement, especially if the states must be communicated over some distance. This paper describes a quantum mechanism for the economically significant $n$-player public goods game that requires only two-particle entanglement and is thus much easier to implement than more general quantum mechanisms. In spite of the large temptation to free ride on the efforts of others in this game, two-particle entanglement is sufficient to give near optimal expected payoff when players use a simple mixed strategy for which no player can benefit by making different choices. This mechanism can also address some heterogeneous preferences among the players.

quant-ph↗

arXiv2002

Eliminating Public Knowledge Biases in Small Group Predictions

We present a novel methodology for identifying public knowledge and eliminating the biases it creates when aggregating information in small group settings. A two stage mechanism consisting of an information market and a coordination game is used to reveal and adjust for individuals' public information. A nonlinear aggregation of their decisions then allows for the calculation of the probability of the future outcome of an uncertain event, which can then be compared to both the objective probability of its occurrence and the performance of the market as a whole. Experiments show that this nonlinear aggregation mechanism outperforms both the imperfect market and the best of the participants. .

cond-mat.stat-mech↗

arXiv2001

Forecasting Uncertain Events with Small Groups

We present a novel methodology for predicting future outcomes that uses small numbers of individuals participating in an imperfect information market. By determining their risk attitudes and performing a nonlinear aggregation of their predictions, we are able to assess the probability of the future outcome of an uncertain event and compare it to both the objective probability of its occurrence and the performance of the market as a whole. Experiments show that this nonlinear aggregation mechanism vastly outperforms both the imperfect market and the best of the participants.

cond-mat.stat-mech↗