Abstract
In this paper we consider the asymmetric assignment problem and we propose a new auction algorithm for its solution. The algorithm uses in a novel way the recently proposed idea of reverse auction, where, in addition to persons bidding for objects by raising their prices, we also have objects competing for persons by essentially offering discounts. In practice, the new algorithm apparently deals better with price wars than the currently existing auction algorithms. As a result, it tends to terminate substantially (and often dramatically) faster than its competitors.
Original language | English (US) |
---|---|
Pages (from-to) | 277-297 |
Number of pages | 21 |
Journal | Computational Optimization and Applications |
Volume | 1 |
Issue number | 3 |
DOIs | |
State | Published - Dec 1992 |
Externally published | Yes |
Keywords
- Assignment
- auction algorithm
- network programming
- optimization
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Applied Mathematics