Online Learning of Nash Equilibria in Congestion Games (Q5252509): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive routing with end-to-end feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing without regret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-armed bandit problem with covariates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Population games, stable games, and passivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly α-favourable measure spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive game playing using multiplicative weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable games and their dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentiated gradient versus gradient descent for linear predictors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative updates outperform generic no-regret learning in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concrete approach to classical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / 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: Q3524727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games with continuous player sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885257 / rank
 
Normal rank

Latest revision as of 03:40, 10 July 2024

scientific article; zbMATH DE number 6441917
Language Label Description Also known as
English
Online Learning of Nash Equilibria in Congestion Games
scientific article; zbMATH DE number 6441917

    Statements

    Online Learning of Nash Equilibria in Congestion Games (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2015
    0 references
    online learning
    0 references
    population dynamics
    0 references
    regret minimization
    0 references
    congestion games
    0 references
    Nash equilibria
    0 references

    Identifiers

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