Max-Min Fair Sensor Scheduling: Game-theoretic Perspective and Algorithmic Solution
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2019
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915222302752768 |
|---|---|
| author | Wu, Shuang Ren, Xiaoqiang Hong, Yiguang Shi, Ling |
| author_facet | Wu, Shuang Ren, Xiaoqiang Hong, Yiguang Shi, Ling |
| contents | We consider the design of a fair sensor schedule for a number of sensors monitoring different linear time-invariant processes. The largest average remote estimation error among all processes is to be minimized. We first consider a general setup for the max-min fair allocation problem. By reformulating the problem as its equivalent form, we transform the fair resource allocation problem into a zero-sum game between a "judge" and a resource allocator. We propose an equilibrium seeking procedure and show that there exists a unique Nash equilibrium in pure strategy for this game. We then apply the result to the sensor scheduling problem and show that the max-min fair sensor scheduling policy can be achieved. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1902_03594 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Max-Min Fair Sensor Scheduling: Game-theoretic Perspective and Algorithmic Solution Wu, Shuang Ren, Xiaoqiang Hong, Yiguang Shi, Ling Systems and Control We consider the design of a fair sensor schedule for a number of sensors monitoring different linear time-invariant processes. The largest average remote estimation error among all processes is to be minimized. We first consider a general setup for the max-min fair allocation problem. By reformulating the problem as its equivalent form, we transform the fair resource allocation problem into a zero-sum game between a "judge" and a resource allocator. We propose an equilibrium seeking procedure and show that there exists a unique Nash equilibrium in pure strategy for this game. We then apply the result to the sensor scheduling problem and show that the max-min fair sensor scheduling policy can be achieved. |
| title | Max-Min Fair Sensor Scheduling: Game-theoretic Perspective and Algorithmic Solution |
| topic | Systems and Control |
| url | https://arxiv.org/abs/1902.03594 |