An incentive compatible mechanism for booth auction / Puchit Sariddichainunta

Abstract

The winner determination problem (WDP) for a single object auction is a relatively easy problem to solve using the greedy algorithm. It can be formulated and solved using the MIP optimization solver. In this thesis, we applied WDP to solve a booth auction which is one of the nonidentical multiple-object auctions known to be NP-hard. Formulation of the winner determination model for a linear arrangement of a multiple-object auction is explained in this study. Moreover, this research improves the algorithm from the study of Rothkopf et al (1998) having polynomial time complexity. Finally, the comparison of a running time exhibits the advantage of our proposed algorithm. The simulation results are discussed.