  In this work, we consider a network composed of several single-antenna
transmitter-receiver pairs in which each pair aims at selfishly minimizing the
power required to achieve a given signal-to-interference-plus-noise ratio. This
is obtained modeling the transmitter-receiver pairs as rational agents that
engage in a non-cooperative game. Capitalizing on the well-known results on the
existence and structure of the generalized Nash equilibrium (GNE) point of the
underlying game, a low complexity, iterative and distributed algorithm is
derived to let each terminal reach the GNE using only a limited feedback in the
form of link-layer acknowledgement (ACK) or negative acknowledgement (NACK).
Numerical results are used to prove that the proposed solution is able to
achieve convergence in a scalable and adaptive manner under different operating
conditions.
