Full Text:
<141>
CLC number:
On-line Access: 2025-04-02
Received: 2024-10-24
Revision Accepted: 2025-01-24
Crosschecked: 0000-00-00
Cited: 0
Clicked: 218
Analysis of Pareto equilibrium inmulti-objective games using the semi-tensor product
| |||||||||||||
Fanyueyang ZHANG, Jun ′ e FENG ‡. Analysis of Pareto equilibrium inmulti-objective games using the semi-tensor product[J]. Frontiers of Information Technology & Electronic Engineering, 1998, -1(-1): .
@article{title="Analysis of Pareto equilibrium inmulti-objective games using the semi-tensor product",
author="Fanyueyang ZHANG, Jun ′ e FENG ‡",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2400945"
}
%0 Journal Article
%T Analysis of Pareto equilibrium inmulti-objective games using the semi-tensor product
%A Fanyueyang ZHANG
%A Jun ′ e FENG ‡
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2400945
TY - JOUR
T1 - Analysis of Pareto equilibrium inmulti-objective games using the semi-tensor product
A1 - Fanyueyang ZHANG
A1 - Jun ′ e FENG ‡
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2400945
Abstract: multi-objective games (MOGs) have received much attention in recent years is a class of games with payoff vectors. Based on the semi-tensor product (STP), this paper discusses the MOG, including the existence, finite-step reachability and finite-step controllability of pareto equilibrium of this model from both static and dynamic perspectives. First, the MOG concept is presented using multi-layer graphs, and the STP is used to convert the payoff function into its algebraic form. Then, from the static perspective, two necessary and sufficient conditions are proposed to verify whether all players can meet their expectations and whether the strategy profile is a pareto equilibrium, respectively. Thus, from the dynamic perspective, a strategy updating rule is designed to investigate the finite-step reachability of the evolutionary MOG. Finally, the finite-step controllability of the evolutionary MOG is analyzed by adding pseudo-players, and a backward search algorithm is provided to find the shortest evolutionary process and control sequence
Open peer comments: Debate/Discuss/Question/Opinion
<1>