Traditionally FM broadcasting licenses have been assigned to applicants through beauty contest processes in Taiwan. In contrast, for finding a consistent and Pareto-optimal result of the wireless licenses assignment problem, a new popular approach globally is through an auction process. However, there are so many auction formats in this approach. After considering the synergic value of FM broadcasting licenses, combinatorial auction is proposed as an excellent solution to the FM broadcasting licenses releasing problem. The main advantage of the combinatorial auction is to solve the synergic value issue directly; whatever, its disadvantage is to bring a new computational complexity issue. In this thesis, moreover, different implementations of combinatorial auction are analyzed from the computational complexity viewpoint in details. Also some good and possible mechanisms in combinatorial auctions are suggested to be used for releasing the FM broadcasting licenses in Taiwan. Especially a prototype system based on the combinatorial auction has been implemented for showing the feasibility of the designed mechanisms.