The Complexity of Nash Equilibria in Limit-Average Games (Q3090850): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105321970 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1109.6220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Omega-Languages Defined by Mean-Payoff Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibria for Reachability Objectives in Multi-player Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Mean-payoff and Energy Games / 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: New complexity results about Nash equilibria / 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: Concurrent reachability games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points in <i>n</i> -person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect information stochastic games and related classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Nash Equilibria in Infinite Multiplayer Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Nash Equilibria in Stochastic Multiplayer Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church Synthesis Problem for Noisy Input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-player stochastic games. I: A reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-player stochastic games. II: The case of recursive games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic graphical games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 10:02, 4 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of Nash Equilibria in Limit-Average Games
scientific article

    Statements

    The Complexity of Nash Equilibria in Limit-Average Games (English)
    0 references
    0 references
    0 references
    2 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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