package bidding
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 1)

H-INDEX

7
(FIVE YEARS 0)

2014 ◽  
Vol 85 ◽  
pp. 210-231 ◽  
Author(s):  
John H. Kagel ◽  
Yuanchuan Lien ◽  
Paul Milgrom

2010 ◽  
Vol 70 (1) ◽  
pp. 146-169 ◽  
Author(s):  
Jacob K. Goeree ◽  
Charles A. Holt

2010 ◽  
Vol 2 (3) ◽  
pp. 160-185 ◽  
Author(s):  
John H Kagel ◽  
Yuanchuan Lien ◽  
Paul Milgrom

We use theory and experiment to explore the performance of multi-round, price-guided, combinatorial auctions. We define efficiency-relevant and core-relevant packages and show that if bidders bid aggressively on these and losing bidders bid to their limits, then the auction leads to efficient or core allocations. We study the theoretically relevant behaviors and hypothesize that subjects will make only a few significant bids, and that certain simulations with auto-bidders will predict variations in performance across different environments. Testing the combinatorial clock auction (CCA) design, we find experimental support for these two hypotheses. We also compare the CCA to a simultaneous ascending auction. (JEL D44)


Sign in / Sign up

Export Citation Format

Share Document