  We consider a distributed IoT network, where each node wants to minimize its
age of information and there is a cost to make any transmission. A collision
model is considered, where any transmission is successful from a node to a
common monitor if no other node transmits in the same slot. There is no
explicit communication/coordination between any two nodes. The selfish
objective of each node is to minimize a function of its individual age of
information and its transmission cost. Under this distributed competition
model, the objective of this paper is to find a distributed transmission
strategy for each node that converges to an equilibrium. The proposed
transmission strategy only depends on the past observations seen by each node
and does not require explicit information of the number of other nodes, or
their strategies. A simple update strategy is shown to converge to an
equilibrium, that is in fact a Nash equilibrium for a suitable utility
function, that captures all the right tradeoffs for each node. In addition, the
price of anarchy for the utility function is shown to approach unity as the
number of nodes grows large.
