Empirical hardness for mixed auctions

Authors:
Pablo Almajano;Jesús Cerquides;Juan A. Rodriguez-Aguilar
Affiliations:
IIIA, Artificial Intelligence Research Institute, CSIC, Spanish National Research Council;UB, WAI, Dep. Matemàtica Aplicada i Anàlisi, Universitat de Barcelona;IIIA, Artificial Intelligence Research Institute, CSIC, Spanish National Research Council
Venue:
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Year:
2009

Citing 5
Cited 2

Combinatorial Auctions

Combinatorial Auctions
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A test suite for the evaluation of mixed multi-unit combinatorial auctions

Journal of Algorithms
Bidding languages and winner determination for mixed multi-unit combinatorial auctions

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Charting the tractability frontier of mixed multi-unit combinatorial auctions

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Combining adaptive goal-driven agents with mixed multi-unit combinatorial auctions

Proceedings of the 13th International Conference on Computer Systems and Technologies
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.