scholarly journals A Regret-Based Algorithm for Computing All Pure Nash Equilibria for Noncooperative Games in Normal Form

2020 ◽  
Vol 10 (06) ◽  
pp. 1253-1259
Author(s):  
H. W. Corley
2021 ◽  
pp. 1-14
Author(s):  
Bruno Yun ◽  
Srdjan Vesic ◽  
Nir Oren

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.


2019 ◽  
Vol 21 (02) ◽  
pp. 1940011
Author(s):  
Thomas A. Weber

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.


2010 ◽  
Vol 12 (03) ◽  
pp. 253-261
Author(s):  
RYUSUKE SHINOHARA

The relationship between coalition-proof (Nash) equilibria in a normal-form game and those in its subgame is examined. A subgame of a normal-form game is a game in which the strategy sets of all players in the subgame are subsets of those in the normal-form game. In this paper, focusing on a class of aggregative games, we provide a sufficient condition for the aggregative game under which every coalition-proof equilibrium in a subgame is also coalition-proof in the original normal-form game. The stringency of the sufficient condition means that a coalition-proof equilibrium in a subgame is rarely a coalition-proof equilibrium in the whole game.


2011 ◽  
Vol 19 (6) ◽  
pp. 383-408 ◽  
Author(s):  
Leonidas Spiliopoulos

This article models the learning process of a population of randomly rematched tabula rasa neural network agents playing randomly generated 3 × 3 normal form games of all strategic types. Evidence was found of the endogenous emergence of a similarity measure of games based on the number and types of Nash equilibria, and of heuristics that have been found effective in describing human behavior in experimental one-shot games. The neural network agents were found to approximate experimental human behavior very well across various dimensions such as convergence to Nash equilibria, equilibrium selection, and adherence to principles of dominance and iterated dominance. This is corroborated by evidence from five studies of experimental one-shot games, because the Spearman correlation coefficients of the probability distribution over the neural networks’ and human subjects’ actions ranged from 0.49 to 0.89.


Author(s):  
Rodica Ioana Lung

<p>A Direct method of computing mixed form Nash equilibria of a normal form game by using a simple evolutionary algorithm is proposed. The Direct Evolutionary Search algorithm (DES) uses a generative relation for Nash equilibria with binary tournament selection and uniform mutation. Numerical experiments are used to illustrate the efficiency of the method.</p>


Sign in / Sign up

Export Citation Format

Share Document