Generalized mirror descents in congestion games (Q334813): Difference between revisions

From MaRDI portal
Changed an 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: W2398693750 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.07774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for Full-Information and Bandit Online Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent imitation dynamics in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence to equilibrium of logit dynamics for strategic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing without regret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tatonnement beyond gross substitutes? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of regret minimization dynamics in concave games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5744805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive game playing using multiplicative weights / 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: Load balancing without regret in the bulletin board model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic robustness of the price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885257 / rank
 
Normal rank

Latest revision as of 21:10, 12 July 2024

scientific article
Language Label Description Also known as
English
Generalized mirror descents in congestion games
scientific article

    Statements

    Generalized mirror descents in congestion games (English)
    0 references
    0 references
    0 references
    1 November 2016
    0 references
    0 references
    mirror-descent algorithm
    0 references
    no-regret dynamics
    0 references
    convergence
    0 references
    bandit model
    0 references
    0 references
    0 references