We consider a family of distributed algorithms for allocating
resources among pairs of communicating users in an 
ad hoc wireless network with single or multiple transmit antennas. The goal is to maximize the total utility
among the users, where utility depends on each pairs received SINR. These algorithms are 
based on allowing users to exchange "interference 
prices," which indicate the cost of interference at 
each receiver. Given these prices users then maximize 
their own
utility minus their costs.  In previous work, we 
have showed the
convergence of such algorithms using ideas from 
game theory, in particular super-modular games. In this 
this talk we
discuss an alternative convergence proof that 
applies to a larger class of utility functions.