Fixed point theorems for nonconvex valued correspondences and applications in game theory
Abstract
In this paper, we introduce several types of correspondences: weakly naturally quasiconvex, *-weakly naturally quasiconvex, weakly biconvex and correspondences with *--weakly convex graph and we prove some fixed point theorems for these kinds of correspondences. As a consequence, using a version of W. K. Kim's quasi-point theorem, we obtain the existence of equilibria for a quasi-game.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.