ICE: An Expressive Iterative Combinatorial Exchange

View/ Open
Author
Shneidman, Jeffrey
Lahaie, Sebastien
Cavallo, Ruggiero
Juda, Adam
Note: Order does not necessarily reflect citation order of authors.
Published Version
https://doi.org/10.1613/jair.2440Metadata
Show full item recordCitation
Lubin, Benjamin, Adam Juda, Ruggiero Cavallo, Sebastien Lahai, Jeffrey Shneidman, and David C. Parkes. 2008. ICE: An expressive iterative combinatorial exchange. Journal of Artificial Intelligence Research 33: 33-77.Abstract
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE).The exchange incorporates a tree-based bidding language (TBBL) that is concise and expressive for
CEs. Bidders specify lower and upper bounds in TBBL on their value for different trades and refine these
bounds across rounds. These bounds allow price discovery and useful preference elicitation in early
rounds, and allow termination with an efficient trade despite partial information on bidder valuations. All
computation in the exchange is carefully optimized to exploit the structure of the bid-trees and to avoid
enumerating trades. A proxied interpretation of a revealed-preference activity rule, coupled with simple
linear prices, ensures progress across rounds. The exchange is fully implemented, and we give results
demonstrating several aspects of its scalability and economic properties with simulated bidding
strategies.
Other Sources
http://www.jair.org/vol/vol33.htmlTerms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:3153321
Collections
- FAS Scholarly Articles [17190]
Contact administrator regarding this item (to report mistakes or request changes)