论文标题
年龄的游戏
Game of Ages
论文作者
论文摘要
我们考虑一个分布式的IoT网络，每个节点都希望在其中最大程度地减少其信息年龄，并且要进行任何传输的成本。考虑碰撞模型，如果没有其他节点在同一插槽中传输，则任何传输都可以从节点到公共监视器成功。任何两个节点之间都没有明确的通信/协调。每个节点的自私目标是最大程度地减少其个人信息时代的函数及其传输成本。在这个分布式竞争模型下，本文的目的是为每个节点找到收敛到平衡的分布式传输策略。提出的传输策略仅取决于每个节点所看到的过去观察结果，并且不需要明确的其他节点数量或其策略的信息。一种简单的更新策略显示出融合到平衡的情况下，实际上，这是适当的效用函数的NASH平衡，可以捕获每个节点的所有正确权衡。另外，随着节点的数量增长，无效功能的无政府状态价格被证明接近统一。
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.
