Bid expressiveness and clearing algorithms in multiattribute double auctions

We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting computational problem of determining an optimal set of trades. We develop a formal semantic framework for characterizing expressible offers, and show conditions under which the allocation problem can be separated into first identifying optimal pairwise trades and subsequently optimizing combinations of those trades. We analyze the bilateral matching problem while taking into consideration relevant results from multiattribute utility theory. Network flow models we develop for computing global allocations facilitate classification of the problem space by computational complexity, and provide guidance for developing solution algorithms. Experimental trials help distinguish tractable problem classes for proposed solution techniques. Categories and Subject Descriptors: F.2 [Theory of Computation]: Analysis Of Al...

• Type: Conference
• Year: 2006
• Where: SIGECOM
• Authors: Yagil Engel, Michael P. Wellman, Kevin M. Lochner
• Keywords: ALGORITHMS AND PROBLEM, Bilateral Matching Problem, Computational Problem, SIGECOM 2006