A decomposition algorithm for \(N\)-player games (Q847797): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3624005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Independence of Multivariate <i>B</i>-Splines, I. Triangulations of Simploids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global Newton method to compute Nash equilibria. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorems for game trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria by iterated polymatrix approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Combinatorial Lemmas in Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard-to-Solve Bimatrix Games / rank
 
Normal rank

Revision as of 11:04, 2 July 2024

scientific article
Language Label Description Also known as
English
A decomposition algorithm for \(N\)-player games
scientific article

    Statements

    A decomposition algorithm for \(N\)-player games (English)
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    game theory
    0 references
    computation
    0 references
    equilibrium
    0 references
    decomposition
    0 references
    triangulation
    0 references

    Identifiers