A Generic Internet Trading Framework for Online Auctions

In this chapter, we introduce a generic Internet trading framework for online auctions. We present the requirements and service of the framework. A generic OR/XOR bidding language that can express different OR/XOR combinations is adopted for Web interfaces. The framework is implemented with free open-source technologies already successfully tested in industries. Researchers can use the platform to implement different electronic-market mechanisms, simulate the market behavior of their interests, and experiment with it. We also provide future directions for the framework design.

A Generic Internet Trading Framework for Online Auctions

In this chapter, we introduce a generic Internet trading framework for online auctions. We present the requirements and service of the framework. A generic OR/XOR bidding language that can express different OR/XOR combinations is adopted for Web interfaces. The framework is implemented with free open-source technologies already successfully tested in industries. Researchers can use the platform to implement different electronic-market mechanisms, simulate the market behavior of their interests, and experiment with it. We also provide future directions for the framework design.

An Internet Trading Platform for Testing Auction and Exchange Mechanisms

In this chapter we present a generic electronic market platform that is designed to run different kinds of auctions and exchanges. Researchers can use the platform to implement different electronic market mechanisms, simulate the market behavior of their interests, and experiment with it. A generic OR/XOR bidding language that can express different OR/XOR combinations is implemented for Web interfaces. Different auctions including combinatorial auctions, multiple-round reverse auctions and multiple homogeneous good auctions have been built and run successfully on the platform.

ICE: An Expressive Iterative Combinatorial Exchange

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.