Abstract— A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention has been given to the design of efficient and fair scheduling schemes that are centrally controlled by a base station (BS) whose decisions depend on the channel conditions of each mobile. The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. In this paper, we study the scheduling problem from a game-theoretic perspective in which some of the mobiles may be noncooperative. We model this as a signaling game and study its equilibria. We then propose various approaches to enforce truthful signaling of the radio channel conditions: an approach based on some knowledge of the mobiles’ policies, and an approach that replaces this knowledge by a stochastic approximations approach that combines estimation and control. We further identify o...