ICE: An Iterative Combinatorial Exchange
Access StatusFull text of the requested work is not available in DASH at this time ("dark deposit"). For more information on dark deposits, see our FAQ.
MetadataShow full item record
CitationParkes, David C., Ruggiero Cavallo, Nick Elprin, Adam Juda, Sebastien Lahaie, Benjamin Lubin, Loizos Michael, Jeffrey Shneidman, and Hassan Sultan. 2005. ICE: An iterative combinatorial exchange. In EC'05: Proceedings of the 6th ACM Conference on Electronic Commerce: June 5-8, 2005, Vancouver, Canada, 249-258. New York, N.Y.: ACM Press.
AbstractWe present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive for CEs. Bidders specify lower and upper bounds on their value for different trades. 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 ensures progress across rounds. A VCG-based payment scheme that has been shown to mitigate opportunities for bargaining and strategic behavior is used to determine final payments. The exchange is fully implemented and in a validation phase.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4686809
- FAS Scholarly Articles