In this paper, we introduce the concept of order-clustered fixed point of set-valued mappings on preordered sets and give several generalizations of the extension of the Abian-Brown fixed point theorem provided in (Mas-Colell et al. in Microeconomic Theory, 1995), which is from chain-complete posets to chain-complete preordered sets. By using these generalizations and by applying the order-increasing upward property of set-valued mappings, we prove several existence theorems of the extended and generalized Nash equilibria of nonmonetized noncooperative games on chain-complete preordered sets
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
In this paper, we first obtain existence theorems of Nash equilibria for non-cooperative n-person ga...
AbstractWe present generalizations of the KKM principle and of the Kakutani-Fan-Glicksberg fixed poi...
We present fixed point theorems for correspondences with values in a partially ordered set. generali...
AbstractWe define a notion of Nash equilibrium for an arbitrary family of set-valued maps with value...
To prove the existence of Nash equilibrium by traditional ways, a common condition that the preferen...
In this paper, by using the KKM theory and the properties of Γ-convexity and RC-mapping, we investig...
ABSTRACT. We prove existence results for minimal and maximal xed points of multifunctions in ordered...
This chapter gives an overview how retractions are used to prove fixed point results in ordered sets...
A pure strategy Nash equilibrium point existence theorem is established for a class of n-person gam...
International audienceIn this paper, we develop an Isabelle/HOL library of order-theoretic concepts,...
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibriu...
Fixed point theorems for set valued mappings are reexamined from a unified viewpoint on the local di...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
in Contributions to game theory and management, vol. X. Collected papers presented on the Tenth Inte...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
In this paper, we first obtain existence theorems of Nash equilibria for non-cooperative n-person ga...
AbstractWe present generalizations of the KKM principle and of the Kakutani-Fan-Glicksberg fixed poi...
We present fixed point theorems for correspondences with values in a partially ordered set. generali...
AbstractWe define a notion of Nash equilibrium for an arbitrary family of set-valued maps with value...
To prove the existence of Nash equilibrium by traditional ways, a common condition that the preferen...
In this paper, by using the KKM theory and the properties of Γ-convexity and RC-mapping, we investig...
ABSTRACT. We prove existence results for minimal and maximal xed points of multifunctions in ordered...
This chapter gives an overview how retractions are used to prove fixed point results in ordered sets...
A pure strategy Nash equilibrium point existence theorem is established for a class of n-person gam...
International audienceIn this paper, we develop an Isabelle/HOL library of order-theoretic concepts,...
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibriu...
Fixed point theorems for set valued mappings are reexamined from a unified viewpoint on the local di...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
in Contributions to game theory and management, vol. X. Collected papers presented on the Tenth Inte...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
In this paper, we first obtain existence theorems of Nash equilibria for non-cooperative n-person ga...
AbstractWe present generalizations of the KKM principle and of the Kakutani-Fan-Glicksberg fixed poi...