Weighted and near weighted potential games with application to game theoretic control

Autor:	Daizhan Cheng, Zhengping Ji
Rok vydání:	2022
Předmět:	FOS: Computer and information sciences Computer Science::Computer Science and Game Theory Computer Science - Computer Science and Game Theory Control and Systems Engineering ComputingMilieux_PERSONALCOMPUTING Electrical and Electronic Engineering Computer Science and Game Theory (cs.GT)
Zdroj:	Automatica. 141:110303
ISSN:	0005-1098
DOI:	10.1016/j.automatica.2022.110303
Popis:	An algorithm is proposed to verify whether a finite game is a weighted potential game (WPG) without pre-knowledge on its weights. Then the algorithm is also applied to find the closest WPG for a given finite game. The concept and criterion of near weighted potential games (NWPGs) are given, indicating the evolutionary equivalence between a finite game and its closest WPG. Based on this, a method is proposed for replacing PGs by NWPGs in game theoretic control, which improved the applicability of PG-based optimization.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63fb63a676940704398671b86984a5d https://doi.org/10.1016/j.automatica.2022.110303 Zobrazit plný text záznamu Full Text from ScienceDirect