Axiomatic Definition of the Value of a Matrix Game

1963 ◽  
Vol 8 (3) ◽  
pp. 304-307 ◽  
Author(s):  
E. I. Vilkas
Keyword(s):  
Matrix Game ◽  
Axiomatic Definition ◽  
Definition Of

scholarly journals An Algorithmic Procedure for Finding Nash Equilibrium

2020 ◽  
Vol 40 (1) ◽  
pp. 71-85
Author(s):  
HK Das ◽  
T Saha
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Payoff Matrix ◽  
Matrix Game ◽  
Perfect Equilibrium ◽  
Repeated Use ◽  
Definition Of ◽  
Zero Sum ◽  
Mathematical Construction ◽  
Algorithmic Procedure

This paper proposes a heuristic algorithm for the computation of Nash equilibrium of a bi-matrix game, which extends the idea of a single payoff matrix of two-person zero-sum game problems. As for auxiliary but making the comparison, we also introduce here the well-known definition of Nash equilibrium and a mathematical construction via a set-valued map for finding the Nash equilibrium and illustrates them. An important feature of our algorithm is that it finds a perfect equilibrium when at the start of all actions are played. Furthermore, we can find all Nash equilibria of repeated use of this algorithm. It is found from our illustrative examples and extensive experiment on the current phenomenon that some games have a single Nash equilibrium, some possess no Nash equilibrium, and others had many Nash equilibria. These suggest that our proposed algorithm is capable of solving all types of problems. Finally, we explore the economic behaviour of game theory and its social implications to draw a conclusion stating the privilege of our algorithm. GANIT J. Bangladesh Math. Soc.Vol. 40 (2020) 71-85

scholarly journals Quasi-Perfect Stackelberg Equilibrium

2019 ◽  
Vol 33 ◽  
pp. 2117-2124 ◽  
Author(s):  
Alberto Marchesi ◽  
Gabriele Farina ◽  
Christian Kroer ◽  
Nicola Gatti ◽  
Tuomas Sandholm
Keyword(s):  
Broad Class ◽  
Stackelberg Equilibrium ◽  
Correlated Equilibrium ◽  
Equilibrium Concept ◽  
Extensive Form ◽  
Tree Form ◽  
Axiomatic Definition ◽  
Security Games ◽  
Definition Of ◽  
Perfect Equilibria

Equilibrium refinements are important in extensive-form (i.e., tree-form) games, where they amend weaknesses of the Nash equilibrium concept by requiring sequential rationality and other beneficial properties. One of the most attractive refinement concepts is quasi-perfect equilibrium. While quasiperfection has been studied in extensive-form games, it is poorly understood in Stackelberg settings—that is, settings where a leader can commit to a strategy—which are important for modeling, for example, security games. In this paper, we introduce the axiomatic definition of quasi-perfect Stackelberg equilibrium. We develop a broad class of game perturbation schemes that lead to them in the limit. Our class of perturbation schemes strictly generalizes prior perturbation schemes introduced for the computation of (non-Stackelberg) quasi-perfect equilibria. Based on our perturbation schemes, we develop a branch-and-bound algorithm for computing a quasi-perfect Stackelberg equilibrium. It leverages a perturbed variant of the linear program for computing a Stackelberg extensive-form correlated equilibrium. Experiments show that our algorithm can be used to find an approximate quasi-perfect Stackelberg equilibrium in games with thousands of nodes.

scholarly journals DEFORMATION CONDITIONS FOR PSEUDOREPRESENTATIONS

2019 ◽  
Vol 7 ◽  
Author(s):  
PRESTON WAKE ◽  
CARL WANG-ERICKSON
Keyword(s):  
Stability Condition ◽  
Deformation Theory ◽  
Axiomatic Definition ◽  
Galois Deformation ◽  
Definition Of

Given a property of representations satisfying a basic stability condition, Ramakrishna developed a variant of Mazur’s Galois deformation theory for representations with that property. We introduce an axiomatic definition of pseudorepresentations with such a property. Among other things, we show that pseudorepresentations with a property enjoy a good deformation theory, generalizing Ramakrishna’s theory to pseudorepresentations.

scholarly journals Cladistic hypotheses as degree of equivalence relational structures: implications for three-item statements

2021 ◽  
Author(s):  
Valentin Rineau ◽  
Stéphane Prin
Keyword(s):  
Phylogenetic Trees ◽  
Phylogenetic Reconstruction ◽  
Equivalence Relations ◽  
Strong Connection ◽  
Relational Structures ◽  
Degree Of Equivalence ◽  
Axiomatic Definition ◽  
Finite Set ◽  
Definition Of ◽  
Supertree Methods

AbstractThree-item statements, as minimal informative rooted binary phylogenetic trees on three items, are the minimal units of cladistic information. Their importance for phylogenetic reconstruction, consensus and supertree methods relies on both (i) the fact that any cladistic tree can always be decomposed into a set of three-item statements, and (ii) the possibility, at least under some conditions, to build a new cladistic tree by combining all or part of the three-item statements deduced from several prior cladistic trees. In order to formalise such procedures, several k-adic rules of inference, i.e., rules that allow us to deduce at least one new three-item statement from exactly k other ones, have been identified. However, no axiomatic background has been proposed, and it remains unknown if a particular k-adic rule of inference can be reduced to more basic rules. In order to solve this problem, we propose here to define three-item statements in terms of degree of equivalence relations. Given both the axiomatic definition of the latter and their strong connection to hierarchical classifications, we establish a list of the most basic properties for three-item statements. With such an approach, we show that it is possible to combine five three-item statements from basic rules although they are not combinable only from dyadic rules. Such a result suggests that all higher k-adic rules are well reducible to a finite set of simpler rules.

scholarly journals A New Entropy and Its Properties Based on the Improved Axiomatic Definition of Intuitionistic Fuzzy Entropy

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Dengying Jiang ◽  
Yaxiong Wang
Keyword(s):  
Fuzzy Sets ◽  
Intuitionistic Fuzzy Sets ◽  
Fuzzy Entropy ◽  
Constraint Condition ◽  
Entropy Formula ◽  
Intuitionistic Fuzzy ◽  
Intuitionistic Fuzzy Entropy ◽  
Axiomatic Definition ◽  
Definition Of

Regarding the problem of the existing intuitionistic fuzzy entropy formulas in ordering the partial entropy, the constraint condition that is consistent with the intuitionistic facts is proposed in this paper, the axiomatic definition of entropy which fully reflects the intuition and fuzziness of intuitionistic fuzzy sets is given, and the improved intuitionistic fuzzy entropy formula is constructed according to the entropy axiomatic definition and its properties are studied. Finally, we compare the improved formula with the existing intuitionistic fuzzy entropy formulas, and the result turns out that the improved formula can solve the problem in the entropy ordering theoretically and practically.

MEASURING INCLUSION, SIMILARITY AND COMPATIBILITY BETWEEN ATANASSOV'S INTUITIONISTIC FUZZY SETS

2012 ◽  
Vol 20 (02) ◽  
pp. 261-280 ◽  
Author(s):  
BIN XIE ◽  
LI-WEN HAN ◽  
JU-SHENG MI
Keyword(s):  
Fuzzy Sets ◽  
Similarity Measure ◽  
Intuitionistic Fuzzy Sets ◽  
New Methods ◽  
Intuitionistic Fuzzy ◽  
Inclusion Measure ◽  
Axiomatic Definition ◽  
Definition Of ◽  
Degree Of Similarity ◽  
Atanassov’S Intuitionistic Fuzzy Sets

This paper establishes an axiomatic definition of inclusion measures between Atanassov's intuitionistic fuzzy (A-IF for short) sets. Some kinds of A-IF inclusion measures are constructed by different A-IF operators especially by A-IF implicator, and some new methods for measuring the degree of similarity between A-IF sets are proposed. Moreover, the similarity measure obtained from an A-IF inclusion measure satisfies properties of normal similarity measure. We then define a compatibility measure by a predicates logical idea and construct several functions to measure compatibility for an intuitionistic t -norm.

Sign in / Sign up

Export Citation Format

Share Document