Opportunistic Approachability and Generalized No-Regret Problems (Q5247611): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An analog of the minimax theorem for vector payoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrated learning and correlated equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of adaptive strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approachability in a Two-person Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrated forecasting and merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approachability in infinite dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approachability with bounded memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general internal regret-free strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attainability in Repeated Games with Vector Payoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret minimization in repeated matrix games with variable stage duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Proof of Calibration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity of the Stationary Distribution of a Markov Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous selections. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approachable sets of vector payoffs in stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Unified Framework for Approachability with Full or Partial Monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5502109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed performance regions in Markovian systems with competing decision makers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Necessary and Sufficient Condition for Approachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform conditional variability ordering of probability distributions / rank
 
Normal rank

Latest revision as of 00:52, 10 July 2024

scientific article; zbMATH DE number 6430554
Language Label Description Also known as
English
Opportunistic Approachability and Generalized No-Regret Problems
scientific article; zbMATH DE number 6430554

    Statements

    Opportunistic Approachability and Generalized No-Regret Problems (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Blackwell's approachability
    0 references
    calibrated play
    0 references
    no-regret algorithms
    0 references
    0 references