Linear Programming helps solving large multi-unit combinatorial auctions

by   Rica Gonen, et al.

Previous works suggested the use of Branch and Bound techniques for finding the optimal allocation in (multi-unit) combinatorial auctions. They remarked that Linear Programming could provide a good upper-bound to the optimal allocation, but they went on using lighter and less tight upper-bound heuristics, on the ground that LP was too time-consuming to be used repetitively to solve large combinatorial auctions. We present the results of extensive experiments solving large (multi-unit) combinatorial auctions generated according to distributions proposed by different researchers. Our surprising conclusion is that Linear Programming is worth using. Investing almost all of one's computing time in using LP to bound from above the value of the optimal solution in order to prune aggressively pays off. We present a way to save on the number of calls to the LP routine and experimental results comparing different heuristics for choosing the bid to be considered next. Those results show that the ordering based on the square root of the size of the bids that was shown to be theoretically optimal in a previous paper by the authors performs surprisingly better than others in practice. Choosing to deal first with the bid with largest coefficient (typically 1) in the optimal solution of the relaxed LP problem, is also a good choice. The gap between the lower bound provided by greedy heuristics and the upper bound provided by LP is typically small and pruning is therefore extensive. For most distributions, auctions of a few hundred goods among a few thousand bids can be solved in practice. All experiments were run on a PC under Matlab.


page 1

page 2

page 3

page 4


Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics

Finding optimal solutions for multi-unit combinatorial auctions is a har...

Linear Programming Bounds for Almost-Balanced Binary Codes

We revisit the linear programming bounds for the size vs. distance trade...

An efficient model for the preemptive single machine scheduling of equal-length jobs

We propose a Boolean Linear Programming model for the preemptive single ...

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines

Mixed-integer linear programming (MILP) is at the core of many advanced ...

Learning Optimal Linear Regularizers

We present algorithms for efficiently learning regularizers that improve...

Data-Driven Projection for Reducing Dimensionality of Linear Programs: Generalization Bound and Learning Methods

This paper studies a simple data-driven approach to high-dimensional lin...

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method

The simplex method for linear programming is known to be highly efficien...

Please sign up or login with your details

Forgot password? Click here to reset