Q5111251 (Q5111251): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Price of Anarchy for Polynomial Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5357713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal paths in weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstraction-refinement methodology for reasoning about network games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Resource Allocation Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-formation games with regular objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal reachability problem of weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgame Perfection for Equilibria in Quantitative Reachability Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibrium for Upward-Closed Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games with secure equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy of finite congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What good are digital clocks? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive routing over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention Issues in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Network Formation Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Order Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria and the price of anarchy for flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank

Revision as of 18:17, 22 July 2024

scientific article; zbMATH DE number 7204371
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7204371

    Statements

    0 references
    0 references
    0 references
    26 May 2020
    0 references
    network games
    0 references
    timed automata
    0 references
    Nash equilibrium
    0 references
    equilibrium inefficiency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers