摘要: Abstract This paper studies potential games allowing the possibility that players have incomplete preferences and empty best-response sets. We define four notions of games, ordinal, generalized best-response, characterize them using cycle conditions. study Nash equilibria show set remains same when every player’s are replaced with smallest (best-response) relation or a completion it. Similar results established about strict ordinal games. Lastly, we examine relations among as well pseudo-potential