A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/23m1549237 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4386686307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-1 bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of NP-Complete Variants of Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical Distribution of Equilibrium Play and Its Testing Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria in random games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for approximate Nash equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the best Nash Equilibrium in <i>n<sup>o</sup></i><sup>(log <i>n</i>)</sup>-time breaks the Exponential Time Hypothesis / 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: Q2934593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Methods for Computing Approximate Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed methods for computing approximate equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games / 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: Approximating the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for constrained approximate Nash equilibria / 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: Approximate well-supported Nash equilibria below two-thirds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the communication complexity of approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of fixed rank: a hierarchy of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for approximating Nash equilibria of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well supported approximate equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares meets Nash: lower bounds for finding any equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imitation games and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple complexity from imitation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Rank Two-Player Games are PPAD-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random bimatrix games are asymptotically easy to solve (a simple proof) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity (for Algorithm Designers) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank

Latest revision as of 01:56, 3 August 2024

scientific article; zbMATH DE number 7744116
Language Label Description Also known as
English
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
scientific article; zbMATH DE number 7744116

    Statements

    A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2023
    0 references
    0 references
    Nash equilibria
    0 references
    well-supported Nash equilibria
    0 references
    query complexity
    0 references
    bimatrix games
    0 references
    0 references
    0 references
    0 references
    0 references