ScholarLens Back to search
2006•Journal of Jilin University(Science Edition)Requires access

A Search Method for Finding a Simple Nash Equilibrium in Two-player Games

Sun Cheng-min

Open publisher page 0 citations

Abstract

Nash Equilibria computing is one of the most important problems in non-cooperative games. In this paper, we give a searching algorithm for finding a simple Nash equilibrium in two-player games. We limit the searching strategy space according to rank and the conditionally dominant rows of the payoff matrix, order the space, and seach the limited and ordered strategy space for finding a simple Nash equilibrium.

About this research paper

What this paper is about

Nash Equilibria computing is one of the most important problems in non-cooperative games. In this paper, we give a searching algorithm for finding a simple Nash equilibrium in two-player games. We limit the searching strategy space according to rank and the conditionally dominant rows of the payoff matrix, order the space, and seach the limited and ordered strategy space for finding a simple Nash equilibrium.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Nash Equilibria computing is one of the most important problems in non-cooperative games. In this paper, we give a searching algorithm for finding a simple Nash equilibrium in two-player games. We limit the searching strategy space according to rank and the conditionally dominant rows of the payoff matrix, order the space, and seach the limited and ordered strategy space for finding a simple Nash equilibrium.

Key concepts: Epsilon-equilibrium, Nash equilibrium, Best response, Correlated equilibrium, Mathematical economics, Simple (philosophy), Normal-form game, Trembling hand perfect equilibrium

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Search Method for Finding a Simple Nash Equilibrium in Two-player Games — Research Paper | ScholarLens