2018
DOI: 10.1109/tac.2018.2824978
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative Control via Congestion Game Approach

Abstract: The optimization of facility-based systems is considered. First, the congestion game is converted into a matrix form, so that the matrix approach is applicable. Then, a facilitybased system with a system performance criterion is considered. A necessary and sufficient condition is given to assure that the system is convertible into a congestion game with the given system performance criterion as its potential function by designing proper facility-cost functions. Using this technology, for a dynamic facility-bas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1
1

Relationship

3
7

Authors

Journals

citations
Cited by 28 publications
(15 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…Using STP technique, Han et al. [ 11 ] obtained necessary and sufficient conditions for the solvability. Moreover, a design method is also proposed.…”
Section: Utility Designmentioning
confidence: 99%
“…Using STP technique, Han et al. [ 11 ] obtained necessary and sufficient conditions for the solvability. Moreover, a design method is also proposed.…”
Section: Utility Designmentioning
confidence: 99%
“…Based on the potential equation and STP approach, some elementary studies have been done for this [79,80]. As for the game theoretic control of networked games, Bayesian game may provide a nice framework, because in a networked game a player can hardly get complete information [81].…”
Section: Game Theoretic Controlmentioning
confidence: 99%
“…In our recent work [10], a simple matrix formula is obtained to calculate the Shapley value and the basic mathematical method is the semitensor product of matrices (STP), which is a generalization of the traditional matrix product [11]. is method has been successfully applied in the analysis and control problems of logical networks [12][13][14][15][16][17][18][19][20][21][22][23][24][25], and then it has been used in finite game theory [26][27][28][29][30], evolutionary games [31][32][33][34][35][36][37][38], finite automata [39,40], graph theory [41], etc. Unlike the canonical cooperative games being considered in [10], this paper studies a new class of cooperative games, called graphical cooperative games.…”
Section: Introductionmentioning
confidence: 99%