• Title/Summary/Keyword: Nash equilibrium theorem.

Search Result 18, Processing Time 0.017 seconds

BEST PROXIMITY PAIRS AND NASH EQUILIBRIUM PAIRS

  • Kim, Won-Kyu;Kum, Sang-Ho
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.5
    • /
    • pp.1297-1310
    • /
    • 2008
  • Main purpose of this paper is to combine the optimal form of Fan's best approximation theorem and Nash's equilibrium existence theorem into a single existence theorem simultaneously. For this, we first prove a general best proximity pair theorem which includes a number of known best proximity theorems. Next, we will introduce a new equilibrium concept for a generalized Nash game with normal form, and as applications, we will prove new existence theorems of Nash equilibrium pairs for generalized Nash games with normal form.

GENERALIZATIONS OF THE NASH EQUILIBRIUM THEOREM ON GENERALIZED CONVEX SPACES

  • Park, Se-Hie
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.4
    • /
    • pp.697-709
    • /
    • 2001
  • Generalized forms of the von neumann-Sion type minimax theorem, the Fan-Ma intersection theorem, the Fan-a type analytic alternative, and the Nash-Ma equilibrium theorem hold for generalized convex spaces without having any linear structure.

  • PDF

WEIGHT NASH EQUILIBRIA FOR GENERALIZED MULTIOBJECTIVE GAMES

  • Kim, Won Kyu
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.13 no.1
    • /
    • pp.13-20
    • /
    • 2000
  • The purpose of this paper is to give a new existence theorem of a generalized weight Nash equilibrium for generalized multiobjective games by using the quasi-variational inequality due to Yuan.

  • PDF

ELEMENTS OF THE KKM THEORY FOR GENERALIZED CONVEX SPACE

  • Park, Se-Hei
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.1
    • /
    • pp.1-28
    • /
    • 2000
  • In the present paper, we introduce fundamental results in the KKM theory for G-convex spaces which are equivalent to the Brouwer theorem, the Sperner lemma, and the KKM theorem. Those results are all abstract versions of known corresponding ones for convex subsets of topological vector spaces. Some earlier applications of those results are indicated. Finally, We give a new proof of the Himmelberg fixed point theorem and G-convex space versions of the von Neumann type minimax theorem and the Nash equilibrium theorem as typical examples of applications of our theory.

Alternating Offers Bargaining Game and Wardrop's User Equilibrium (Nash의 협상게임과 Wardrop의 사용자 균형)

  • Lim, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.4 s.82
    • /
    • pp.37-45
    • /
    • 2005
  • This paper presents a relationship between Nash bargaining game and Wardrop user equilibrium, which has been widely used in transportation modeling for route choice problem. Wardrop user equilibrium assumes that drivers in road network have perfect information on the traffic conditions and they choose their optimal paths without cooperation each other. In this regards, if the bargaining game process is introduced in route choice modeling, we may avoid the strong assumptions to some extent. For such purpose, this paper derives a theorem that Nash bargaining solution is equivalent to Wardrop user equilibrium as the barging process continues and prove it with some numerical examples. The model is formulated based on two-person bargaining game. and n-person game is remained for next work.

Existence Proffs of a Nash Equilibrium to a General Class of Differential Games (미분게임 일반모형에 대한 Nash 균형해의 존재증명)

  • Kim, Yang-Yul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.2
    • /
    • pp.97-104
    • /
    • 1989
  • This paper extends the existence proofs of a Nash equilibrium to a more general class of differentila game models with constraints on the control spaces. With the assumptions of continuity, convexity, and compactness, the existence is proved using Kakutani Theorem and via a path-following approach. Furthermore, the proof for a period-by-period optimization of multi-period problems provides an insight to a numerical solution algorithm to differential game models with constraints.

  • PDF