论文信息 - Empirical Hardness for Mixed Auctions

Empirical Hardness for Mixed Auctions

Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the factors making a winner determination problem (WDP) instance hard to solve. In this paper we empirically study the hardness of MMUCAs: (i) to build a model that predicts the time required to solve a WDP instance (because time can be an important constraint during an auction-based negotiation); and (ii) to assess the factors that make a WDP instance hard to solve.

[1] Ulrich Endriss,et al. Winner determination for mixed multi-unit combinatorial auctions via petri nets , 2007, AAMAS '07.

[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[3] Pedro Meseguer,et al. A test suite for the evaluation of mixed multi-unit combinatorial auctions , 2008, J. Algorithms.

[4] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[5] Yoav Shoham,et al. Empirical Hardness Models for Combinatorial Auctions , 2005 .

[6] Meritxell Vinyals,et al. Computationally-efficient winner determination for mixed multi-unit combinatorial auctions , 2008, AAMAS.

[7] Gianluigi Greco,et al. Charting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions , 2009, IJCAI.

[8] Ulrich Endriss,et al. Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions , 2007, EUMAS.