In this paper, we consider decentralized two-level integer programming problems in which there are one decision maker (the leader) at the upper level and two or more decision makers (the followers) at the lower level, and decision variables of each decision maker are integer variables. We assume that there is coordination among the followers while between the leader and the group of all the followers, there is no motivation to cooperate each other. A computational method for obtaining a solution to the problem is developed. To demonstrate the feasibility of the proposed algorithm, numerical experiments are carried out.
