Approximating Nash Equilibria in Tree Polymatrix Games (Q3449601): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2240016676 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.02676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Approximating a Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Network Generalization of the Minmax Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Approximate Nash Equilibria in Polymatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria of Polymatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Nash Equilibrium / rank
 
Normal rank

Latest revision as of 00:13, 11 July 2024

scientific article
Language Label Description Also known as
English
Approximating Nash Equilibria in Tree Polymatrix Games
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references