2018
DOI: 10.1016/j.jfranklin.2017.11.009
|View full text |Cite
|
Sign up to set email alerts
|

Incomplete-profile potential games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…PROOF. From the equivalent equations (28) and the free variables shown by (29), it follows that the set of η pqr (1 ≤ p ≤ q ≤ r ≤ k) is a group of bases of the solution space X 3 . By the construction of ζ uvw pqr , it is straightforward to see that each ζ uvw pqr is orthogonal to X 3 .…”
Section: Symmetric Games and Testing Conditionsmentioning
confidence: 99%
“…PROOF. From the equivalent equations (28) and the free variables shown by (29), it follows that the set of η pqr (1 ≤ p ≤ q ≤ r ≤ k) is a group of bases of the solution space X 3 . By the construction of ζ uvw pqr , it is straightforward to see that each ζ uvw pqr is orthogonal to X 3 .…”
Section: Symmetric Games and Testing Conditionsmentioning
confidence: 99%
“…In this case the Nash e equilibria and optimal strategies are state-depending. This kind of games has been discussed in [68]. Furthermore, the PG under restricted profile is also discussed, and the method for verifying potential and finding potential function for incomplete profile games is obtained in [48].…”
Section: Incomplete Profile Gamesmentioning
confidence: 99%
“…In many cases, the strategies of players in a game may be limited by some actual situation, such as natural conditions, customs, rules and regulations, laws and so on. Due to these factors, a new kind of game, called the IPNFGs is introduced [4]. In an IPNFG, each player has certain suitable strategies to choose, however, some profiles which are against the rules may be infeasible.…”
Section: Introductionmentioning
confidence: 99%
“…[4] Consider a normal form game G = (N , S, C) and assume that the feasible set is a proper subset of S. Then G =(N , S, C, )is called an IPNFG, whose dynamics are…”
mentioning
confidence: 99%