A forward/reverse auction algorithm for asymmetric assignment problems

Dimitri P. Bertsekas, David A. Castañon

Research output: Contribution to journalArticlepeer-review

57 Scopus citations

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 languageEnglish (US)
Pages (from-to)277-297
Number of pages21
JournalComputational Optimization and Applications
Volume1
Issue number3
DOIs
StatePublished - Dec 1992
Externally publishedYes

Keywords

  • Assignment
  • auction algorithm
  • network programming
  • optimization

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A forward/reverse auction algorithm for asymmetric assignment problems'. Together they form a unique fingerprint.

Cite this