scholarly journals A Mixed 0-1 Linear Programming Approach to the Computation of All Pure-Strategy Nash Equilibria of a Finiten-Person Game in Normal Form

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Zhengtian Wu ◽  
Chuangyin Dang ◽  
Hamid Reza Karimi ◽  
Changan Zhu ◽  
Qing Gao
Keyword(s):  
Linear Programming ◽  
Nash Equilibrium ◽  
Normal Form ◽  
Nash Equilibria ◽  
Selection Process ◽  
Pure Strategy ◽  
Programming Approach ◽  
Main Concern ◽  
Person Game ◽  
Strategy Nash Equilibrium

A main concern in applications of game theory is how to effectively select a Nash equilibrium, especially a pure-strategy Nash equilibrium for a finiten-person game in normal form. This selection process often requires the computation of all Nash equilibria. It is well known that determining whether a finite game has a pure-strategy Nash equilibrium is an NP-hard problem and it is difficult to solve by naive enumeration algorithms. By exploiting the properties of pure strategy and multilinear terms in the payoff functions, this paper formulates a new mixed 0-1 linear program for computing all pure-strategy Nash equilibria. To our knowledge, it is the first method to formulate a mixed 0-1 linear programming for pure-strategy Nash equilibria and it may work well for similar problems. Numerical results show that the approach is effective and this method can be easily distributed in a distributed way.

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.

A Necessary and Sufficient Condition for Partial Monotonicity of Noncooperative Games

2020 ◽  
pp. 2050006
Author(s):  
Naoki Matsumoto
Keyword(s):  
Nash Equilibrium ◽  
Pure Strategy ◽  
Noncooperative Games ◽  
Noncooperative Game ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Partial Monotonicity ◽  
Person Game ◽  
Necessary And Sufficient ◽  
Strategy Nash Equilibrium

It is a classical and interesting problem to find a Nash equilibrium of noncooperative games in the strategic form. It is well known that the game always has a mixed-strategy Nash equilibrium, but it does not necessarily have a pure-strategy Nash equilibrium. Takeshita and Kawasaki proved that every noncooperative partially monotone game has a pure-strategy Nash equilibrium, that is, the partial monotonicity is a sufficient condition for a noncooperative game to have a pure-strategy Nash equilibrium. In this paper, we prove the necessary and sufficient condition for a noncooperative [Formula: see text]-person game with [Formula: see text] to be partially monotone. This result is an improvement of Takeshita and Kawasaki’s result.

AN APPLICATION OF A DISCRETE FIXED POINT THEOREM TO A GAME IN EXPANSIVE FORM

2013 ◽  
Vol 30 (03) ◽  
pp. 1340013 ◽  
Author(s):  
HIDEFUMI KAWASAKI ◽  
AKIFUMI KIRA ◽  
SHINPEI KIRA
Keyword(s):  
Fixed Point ◽  
Nash Equilibrium ◽  
Fixed Point Theorem ◽  
Existence Theorem ◽  
Point Theorem ◽  
Pure Strategy ◽  
Contraction Mappings ◽  
Person Game ◽  
Strategy Nash Equilibrium

In this paper, we first present a discrete fixed point theorem for contraction mappings from the product set of integer intervals into itself, which is an extension of Robert's discrete fixed point theorem. Next, we derive an existence theorem of a pure-strategy Nash equilibrium for a noncooperative n-person game from our fixed point theorem. Finally, we show that Kuhn's theorem for a game in expansive form can be explained by our existence theorem.

scholarly journals The Frequency of Convergent Games under Best-Response Dynamics

2021 ◽  
Author(s):  
Samuel C. Wiese ◽  
Torsten Heinrich
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Pure Strategy ◽  
Response Dynamics ◽  
Novel Approach ◽  
Best Response ◽  
Random Games ◽  
Payoff Matrices ◽  
Best Response Dynamic ◽  
Strategy Nash Equilibrium

AbstractWe calculate the frequency of games with a unique pure strategy Nash equilibrium in the ensemble of n-player, m-strategy normal-form games. To obtain the ensemble, we generate payoff matrices at random. Games with a unique pure strategy Nash equilibrium converge to the Nash equilibrium. We then consider a wider class of games that converge under a best-response dynamic, in which each player chooses their optimal pure strategy successively. We show that the frequency of convergent games with a given number of pure Nash equilibria goes to zero as the number of players or the number of strategies goes to infinity. In the 2-player case, we show that for large games with at least 10 strategies, convergent games with multiple pure strategy Nash equilibria are more likely than games with a unique Nash equilibrium. Our novel approach uses an n-partite graph to describe games.

scholarly journals Representing pure Nash equilibria in argumentation

2021 ◽  
pp. 1-14
Author(s):  
Bruno Yun ◽  
Srdjan Vesic ◽  
Nir Oren
Keyword(s):  
Normal Form ◽  
Nash Equilibria ◽  
Pure Strategy ◽  
Normal Form Games

In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil’s Extended Argumentation Frameworks. We demonstrate its correctness, showprove several theoretical properties it satisfies, and outline how it can be used to explain why certain strategies are Nash equilibria to a non-expert human user.

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.

Quantifying Commitment in Nash Equilibria

2019 ◽  
Vol 21 (02) ◽  
pp. 1940011
Author(s):  
Thomas A. Weber
Keyword(s):  
Nash Equilibrium ◽  
Normal Form ◽  
Nash Equilibria ◽  
Dynamic Game ◽  
Subgame Perfect Equilibrium ◽  
Canonical Extension ◽  
Perfect Equilibrium ◽  
Form Game ◽  
Normal Form Game ◽  
The Given

To quantify a player’s commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a “canonical extension,” which allows each player to adjust his or her move with a certain probability. The commitment measure relates to the average overall adjustment probabilities for which the given Nash equilibrium can be implemented as a subgame-perfect equilibrium in the canonical extension.

Sign in / Sign up

Export Citation Format

Share Document