Total tightness implies Nash-solvability for three-person game forms (Q408181): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q59560525, #quickstatements; #temporary_batch_1722280142910
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Vladimir A. Gurvich / rank
Normal rank
 
Property / author
 
Property / author: Vladimir A. Gurvich / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A06 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6019366 / rank
 
Normal rank
Property / zbMATH Keywords
 
Nash equilibrium
Property / zbMATH Keywords: Nash equilibrium / rank
 
Normal rank
Property / zbMATH Keywords
 
Nash-solvability
Property / zbMATH Keywords: Nash-solvability / rank
 
Normal rank
Property / zbMATH Keywords
 
totally tight
Property / zbMATH Keywords: totally tight / rank
 
Normal rank
Property / zbMATH Keywords
 
acyclic
Property / zbMATH Keywords: acyclic / rank
 
Normal rank
Property / zbMATH Keywords
 
dominance-solvable game forms
Property / zbMATH Keywords: dominance-solvable game forms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.12.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108743410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic, or totally tight, two-person game forms: characterization and main properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solvability of positional games in pure strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclicity of improvements in finite game forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance Solvable Voting Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332984 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59560525 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:10, 29 July 2024

scientific article
Language Label Description Also known as
English
Total tightness implies Nash-solvability for three-person game forms
scientific article

    Statements

    Total tightness implies Nash-solvability for three-person game forms (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2012
    0 references
    Nash equilibrium
    0 references
    Nash-solvability
    0 references
    totally tight
    0 references
    acyclic
    0 references
    dominance-solvable game forms
    0 references

    Identifiers