The Winner Determination Model and Computation for Linear Arrangement of Booth Auction

Abstract

The winner determination problem (WDP) for a single object auction is a relatively easy problem to solve using the greedy algorithm. However, a booth auction is one of the nonidentical multiple-object auctions which is NP-hard problem. Formulation of the winner determination model for a linear arrangement of a multiple-object auction is explained in this study – the integer linear programming model. Moreover, this research improves the polynomial time complexity algorithm from the previous study of allocation in geometry-based structure. Finally, the comparison of a running time exhibits the advantage of our proposed algorithm. The simulation results are discussed.