• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.227-233
• /
• 2012

In this paper, using the ${\gamma}$-diagonally $\mathcal{C}$-quasiconcave condition, we will prove a new minimax inequality in a non-convex subset of a topological space which generalizes Fan's minimax inequality and its generalizations in several aspects.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.113-125
• /
• 2006

Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

• Journal of the Korean Mathematical Society
• /
• v.28 no.2
• /
• pp.285-292
• /
• 1991

• Journal of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.823-823
• /
• 1999

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.877-888
• /
• 1998

We show that if dialation operator $\parallel\sigma_r\parallel\; E=\Psi(r)$ of E, then $\Lambda_\subset_{\Psi1}E\subset\;M_\Psi$, We also show that there are lattice-isomorphic copies of $l_\rho \; and \;l_\infty$ in $M \Psi$ under some condition.

• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.719-730
• /
• 1997

From a minimax inequality related to admissible multimaps, we deduce generalized versions of lopsided saddle point theorems, fixed point theorems, existence of maximizable linear functionals, the Walras excess demand theorem, and the Gale-Nikaido-Debreu theorem.

• Journal of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.813-828
• /
• 1999

In this paper, we give a Peleg type KKM theorem on G-convex spaces and using this, we obtain a coincidence theorem. First, these results are applied to a whole intersection property, a section property, and an analytic alternative for multimaps. Secondly, these are used to proved existence theorems of equilibrium points in qualitative games with preference correspondences and in n-person games with constraint and preference correspondences for non-paracompact wetting of commodity spaces.

• Honam Mathematical Journal
• /
• v.31 no.4
• /
• pp.559-578
• /
• 2009

In this work, we obtain intersection theorem, analytic alternative and von Neumann type minimax theorem in G-convex spaces. We also generalize Ky Fan minimax inequality to acyclic versions in G-convex spaces. The result is applied to formulate acyclic versions of other minimax results, a theorem of systems of inequalities and analytic alternative.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.587-592
• /
• 1996

In 1950, Nash [5] first proved the existence of equilibrium for games where the player's preferences are representable by continuous quasiconcave utilities and the strategy sets are simplexes. Next Debreu [3] proved the existence of equilibrium for abstract economies. Recently, the existence of Nash equilibrium can be further generalized in more general settings by several athors, e.g. Shafer-Sonnenschein [6], Borglin-Keiding [2], Yannelis-Prabhaker [8]. In the above results, the convexity assumption is very essential and the main proving tools are the continuous selection technique and the existence of maximal elements. Still there have been a number of generalizations and applications of equilibrium existence theorem in generalized games.