A timestamp-based log-linear algorithm for solving locally-informed multi-agent finite games

In this paper, the distributed Nash equilibrium seeking problem for multi-agent finite games is considered. Considering the locally-informed communication structure, previous centralized game-theoretic learning dynamic methods are not feasible. To this end, we propose a distributed log-linear algori...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems with applications Vol. 249; p. 123677
Main Authors: Li, Zhe, Liu, Changdi, Tan, Shaolin, Liu, Yubai
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.09.2024
Subjects:
Distributed Nash equilibrium seeking
Finite potential games
Log-linear dynamics
Multi-agent cooperation
Sudoku puzzles
Log-linear dynamics
Finite potential games
Distributed Nash equilibrium seeking
Multi-agent cooperation
Sudoku puzzles
ISSN:0957-4174, 1873-6793
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, the distributed Nash equilibrium seeking problem for multi-agent finite games is considered. Considering the locally-informed communication structure, previous centralized game-theoretic learning dynamic methods are not feasible. To this end, we propose a distributed log-linear algorithm by introducing a timestamp-based communication mechanism that enables agents to acquire estimates of the true action profile from their neighborhoods. It is shown that the proposed distributed log-linear algorithm significantly outperforms the existing best response dynamics regarding both effectiveness and reliability. For illustration, a locally-informed multi-player Sudoku puzzle is introduced, where each cell is taken as a player, and each player fills numbers only based on the local information of its neighboring players. The simulation results validate the effectiveness of our algorithm in solving the locally-informed multi-player Sudoku puzzle. Our methodology provides a viable and benchmark approach to address the fully distributed locally-informed multi-agent joint decision-making problem. •A distributed log-linear algorithm is proposed for Nash seeking in finite games.•A locally-informed multiplayer Sudoku puzzle is initialized to evaluate algorithm.•The proposed algorithm is superior in terms of both effectiveness and reliability.
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2024.123677