Published May 2014 | Version Published
Journal Article Open

The Continuous Combinatorial Auction Architecture

  • 1. ROR icon California Institute of Technology

Abstract

The paper reports the architecture of a continuous combinatorial auction. Preferences are based on sets of items and feasibility requires the nonintersection of sets. Countdown clocks replace eligibility and activity requirements typical of rounds-based auctions. Bids remain in the system to be combined with new bids to form winning collections. Increment requirements dictate improvements over appropriate collections of existing bids. The auction evolved from experimental methods and operates at high levels of efficiency. Field applications are reported and result in natural equilibration in a few hours as opposed to days or weeks required by round-based architectures.

Additional Information

© 2014 American Economic Association. We thank Eiichiro Kazumori, Nicola Lansdell, Bill Stevenson, and Arch Roberts, Jr.

Attached Files

Published - aer.104.5.452.pdf

Files

aer.104.5.452.pdf

Files (516.3 kB)

Name Size
md5:328e51d2b7539bcf5d0a49572eb4de6c
516.3 kB Preview Download

Additional details

Identifiers

Eprint ID
44639
Resolver ID
CaltechAUTHORS:20140403-110525103

Dates

Created
2014-04-24
Created from EPrint's datestamp field
Updated
2021-11-10
Created from EPrint's last_modified field