A theorem on the number of Nash equilibria in a bimatrix game

1997 ◽  
Vol 26 (3) ◽  
pp. 353-359 ◽  
Author(s):  
Thomas Quint ◽  
Martin Shubik
1997 ◽  
Vol 26 (3) ◽  
pp. 353-359 ◽  
Author(s):  
Thomas Quint ◽  
Martin Shubik

2009 ◽  
Vol 50 ◽  
Author(s):  
Sigutė Vakarinienė ◽  
Gintautas Misevičius

This research suggests a Nash equilibria model for the selection of investment portfolios. The components of portfolio are found by solving linear programming task with binary variables. In the experimental part of the research ineffective portfolios exerted from this model are tested referring to the statistical data of the stock market indexes of several countries. Realizations of the suggested portfolios are compared to realizations of effective portfolios.


2021 ◽  
pp. 232102222110243
Author(s):  
M. Punniyamoorthy ◽  
Sarin Abraham ◽  
Jose Joy Thoppan

A non-zero sum bimatrix game may yield numerous Nash equilibrium solutions while solving the game. The selection of a good Nash equilibrium from among the many options poses a dilemma. In this article, three methods have been proposed to select a good Nash equilibrium. The first approach identifies the most payoff-dominant Nash equilibrium, while the second method selects the most risk-dominant Nash equilibrium. The third method combines risk dominance and payoff dominance by giving due weights to the two criteria. A sensitivity analysis is performed by changing the relative weights of criteria to check its effect on the ranks of the multiple Nash equilibria, infusing more confidence in deciding the best Nash equilibrium. JEL Codes: C7, C72, D81


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Chunsheng Cui ◽  
Zhongwei Feng ◽  
Chunqiao Tan

Inspired by Shalev’s model of loss aversion, we investigate the effect of loss aversion on a bimatrix game where the payoffs in the bimatrix game are characterized by triangular fuzzy variables. First, we define three solution concepts of credibilistic loss aversion Nash equilibria, and their existence theorems are presented. Then, three sufficient and necessary conditions are given to find the credibilistic loss aversion Nash equilibria. Moreover, the relationship among the three credibilistic loss aversion Nash equilibria is discussed in detail. Finally, for2×2bimatix game with triangular fuzzy payoffs, we investigate the effect of loss aversion coefficients and confidence levels on the three credibilistic loss aversion Nash equilibria. It is found that an increase of loss aversion levels of a player leads to a decrease of his/her own payoff. We also find that the equilibrium utilities of players are decreasing (increasing) as their own confidence levels when players employ the optimistic (pessimistic) value criterion.


2011 ◽  
pp. 65-87 ◽  
Author(s):  
A. Rubinstein

The article considers some aspects of the patronized goods theory with respect to efficient and inefficient equilibria. The author analyzes specific features of patronized goods as well as their connection with market failures, and conjectures that they are related to the emergence of Pareto-inefficient Nash equilibria. The key problem is the analysis of the opportunities for transforming inefficient Nash equilibrium into Pareto-optimal Nash equilibrium for patronized goods by modifying the institutional environment. The paper analyzes social motivation for institutional modernization and equilibrium conditions in the generalized Wicksell-Lindahl model for patronized goods. The author also considers some applications of patronized goods theory to social policy issues.


2020 ◽  
Vol 81 (11) ◽  
pp. 2108-2131
Author(s):  
V. I. Zhukovskiy ◽  
A. S. Gorbatov ◽  
K. N. Kudryavtsev

2021 ◽  
Vol 22 (2) ◽  
pp. 1-38
Author(s):  
Julian Gutierrez ◽  
Paul Harrenstein ◽  
Giuseppe Perelli ◽  
Michael Wooldridge

We define and investigate a novel notion of expressiveness for temporal logics that is based on game theoretic equilibria of multi-agent systems. We use iterated Boolean games as our abstract model of multi-agent systems [Gutierrez et al. 2013, 2015a]. In such a game, each agent  has a goal  , represented using (a fragment of) Linear Temporal Logic ( ) . The goal  captures agent  ’s preferences, in the sense that the models of  represent system behaviours that would satisfy  . Each player controls a subset of Boolean variables , and at each round in the game, player is at liberty to choose values for variables in any way that she sees fit. Play continues for an infinite sequence of rounds, and so as players act they collectively trace out a model for , which for every player will either satisfy or fail to satisfy their goal. Players are assumed to act strategically, taking into account the goals of other players, in an attempt to bring about computations satisfying their goal. In this setting, we apply the standard game-theoretic concept of (pure) Nash equilibria. The (possibly empty) set of Nash equilibria of an iterated Boolean game can be understood as inducing a set of computations, each computation representing one way the system could evolve if players chose strategies that together constitute a Nash equilibrium. Such a set of equilibrium computations expresses a temporal property—which may or may not be expressible within a particular fragment. The new notion of expressiveness that we formally define and investigate is then as follows: What temporal properties are characterised by the Nash equilibria of games in which agent goals are expressed in specific fragments of  ? We formally define and investigate this notion of expressiveness for a range of fragments. For example, a very natural question is the following: Suppose we have an iterated Boolean game in which every goal is represented using a particular fragment of : is it then always the case that the equilibria of the game can be characterised within ? We show that this is not true in general.


Author(s):  
Changhao Sun ◽  
Xiaochu Wang ◽  
Huaxin Qiu ◽  
Wei Sun ◽  
Qingrui Zhou

Energy ◽  
2021 ◽  
Vol 228 ◽  
pp. 120642
Author(s):  
Evangelos G. Tsimopoulos ◽  
Michael C. Georgiadis

Sign in / Sign up

Export Citation Format

Share Document