CABRO: Winner Determination Algorithm for Single-unit Combinatorial Auctions

Authors:
Víctor Muòoz;Javier Murillo
Affiliations:
{vmunozs, jmurillo}@eia.udg.es, University of Girona;{vmunozs, jmurillo}@eia.udg.es, University of Girona
Venue:
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Year:
2008

Citing 9
Cited 1

Towards a universal test suite for combinatorial auction algorithms

Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Solving Combinatorial Auctions Using Stochastic Local Search

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Computationally Manageable Combinatorial Auctions

Computationally Manageable Combinatorial Auctions
Combinatorial Auctions: A Survey

INFORMS Journal on Computing
Combinatorial Auctions

Combinatorial Auctions
The exponentiated subgradient algorithm for heuristic Boolean programming

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
CABOB: a fast optimal algorithm for combinatorial auctions

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2

Schedule coordination through egalitarian recurrent multi-unit combinatorial auctions

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present CABRO, an algorithm for solving the winner determination problem related to single-unit combinatorial auctions. The algorithm is divided in three main phases. The first phase is a pre-processing step with some reduction techniques. The second phase calculates an upper and a lower bound based on a linear programming relaxation in order to delete more bids. Finally, the third phase is a branch and bound depth first search where the linear programming relaxation is used as upper bounding and sorting strategy. Experiments against specific solvers like CASS and general purpose MIP solvers as GLPK and CPLEX show that CABRO is in average the fastest free solver (CPLEX not included), and in some instances drastically faster than any other.