On the Existence of Pure Strategy Nash Equilibrium for Non-cooperative Games in L-convex Spaces

2009 ◽  
Author(s):  
Haishu Lu
Keyword(s):  
Nash Equilibrium ◽  
Cooperative Games ◽  
Pure Strategy ◽  
Non Cooperative Games ◽  
Strategy Nash Equilibrium ◽  
Convex Spaces

ON COURNOT COMPETITION UNDER RANDOM YIELD

2013 ◽  
Vol 30 (04) ◽  
pp. 1350007 ◽  
Author(s):  
XIAOMING YAN ◽  
YONG WANG
Keyword(s):  
Nash Equilibrium ◽  
Production Cost ◽  
Pure Strategy ◽  
Cournot Competition ◽  
Random Yield ◽  
Cournot Model ◽  
Random Capacity ◽  
Strategy Nash Equilibrium

We look at a Cournot model in which each firm may be unreliable with random capacity, so the total quantity brought into market is uncertain. The Cournot model has a unique pure strategy Nash equilibrium (NE), in which the number of active firms is determined by each firm's production cost and reliability. Our results indicate the following effects of unreliability: the number of active firms in the NE is more than that each firm is completely reliable and the expected total quantity brought into market is less than that each firm is completely reliable. Whether a given firm joins in the game is independent of its reliability, but any given firm always hopes that the less-expensive firms' capacities are random and stochastically smaller.

Finding the Pure-Strategy Nash Equilibrium Using a Fixed-Point Algorithm

2013 ◽  
Vol 427-429 ◽  
pp. 1803-1806 ◽  
Author(s):  
Zheng Tian Wu ◽  
Chuang Yin Dang ◽  
Chang An Zhu
Keyword(s):  
Fixed Point ◽  
Nash Equilibrium ◽  
Normal Form ◽  
Pure Strategy ◽  
Payoff Function ◽  
Fixed Point Algorithm ◽  
Linear Programming Formulation ◽  
Active Research ◽  
Person Game ◽  
Strategy Nash Equilibrium

It is well known that determining whether a finite game has a pure-strategy Nash equilibrium is an NP-hard problem and it is an active research topic to find a Nash equilibrium recently. In this paper, an implementation of Dang's Fixed-Point iterative method is introduced to find a pure-strategy Nash equilibrium of a finite n-person game in normal form. There are two steps to find one pure-strategy Nash equilibrium in this paper. The first step is converting the problem to a mixed 0-1 linear programming formulation based on the properties of pure strategy and multilinear terms in the payoff function. In the next step, the Dangs method is used to solve the formulation generated in the former step. Numerical results show that this method is effective to find a pure-strategy Nash equilibrium of a finite n-person game in normal form.

Sign in / Sign up

Export Citation Format

Share Document