Maximal elements of condensing preference maps (Q2638496): Difference between revisions

Let K be a subset of a topological vector space E. We say that a multivalued map T: \(K\to 2^ K\) is a preference map if there exists a binary relation P on K such that \(y\in T(x)\) for \(x\in K\) if and only if (x,y)\(\in P\). A point \(x\in K\) is said to be a maximal element of the preference map T if \(T(x)=\emptyset\). In the paper under review a theorem is proved on the existence of a maximal element of a preference map T: \(D\to 2^ D\) under the following assumptions: 1) D is a closed bounded and convex subset of a Banach space E, 2) for each \(x\in D\) we have that \(x\not\in conv T(x),\) 3) for each \(x\in D\) such that T(x)\(\neq \emptyset\) there exists \(y\in D\) such that \(x\in int T^{-1}(y),\) 4) T is condensing i.e. for each bounded subset U of D with \(\alpha (U)>0\), the set T(U) is bounded and \(\alpha (T(U))<\alpha (U)\) (\(\alpha\) denotes the Kuratowski measure of noncompactness). This theorem is applicable in mathematical economics.