Pareto equilibria for bimatrix games (Q1802491): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5801626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nash subsets and mobility chains in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal nash subsets for bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the set of perfect equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reexamination of the perfectness concept for equilibrium points in extensive games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strictly perfect sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stability of perfect equilibrium points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements of the Nash equilibrium concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistent equilibria in strategic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set of proper equilibria of a bimatrix game / rank
 
Normal rank

Latest revision as of 16:16, 17 May 2024

scientific article
Language Label Description Also known as
English
Pareto equilibria for bimatrix games
scientific article

    Statements

    Identifiers