Near-optimal no-regret algorithms for zero-sum games (Q2516247): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1016/j.geb.2014.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049337234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of linear programs and zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely uncoupled dynamics and Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rate of Convergence of Fictitious Play / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic calibration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive game playing using multiplicative weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing Techniques for Computing Nash Equilibria of Sequential Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rate of convergence of continuous-time fictitious play / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Adaptive Procedure Leading to Correlated Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method of solving a game / rank
 
Normal rank

Latest revision as of 16:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Near-optimal no-regret algorithms for zero-sum games
scientific article

    Statements

    Near-optimal no-regret algorithms for zero-sum games (English)
    0 references
    0 references
    0 references
    12 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    zero-sum games
    0 references
    repeated games
    0 references
    learning
    0 references
    no-regret dynamics
    0 references
    0 references