Conditional universal consistency.
From MaRDI portal
Recommendations
Cites work
- An easier way to calibrate.
- Calibrated forecasting and merging
- Calibrated learning and correlated equilibrium
- Consistency and cautious fictitious play
- Evolution of beliefs and the Nash equilibrium of normal form games
- scientific article; zbMATH DE number 3122013 (Why is no real title available?)
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- scientific article; zbMATH DE number 1306865 (Why is no real title available?)
- scientific article; zbMATH DE number 3205074 (Why is no real title available?)
- Learning mixed equilibria
- Learning to learn, pattern recognition, and Nash equilibrium
- Mixed equilibria and dynamical systems arising from fictitious play in perturbed games
- On Pseudo-Games
- On repeated games with incomplete information played by non-Bayesian players
- Regret in the on-line decision problem
- Self-Calibrating Priors Do Not Exist
- Self-Confirming Equilibrium
- The weighted majority algorithm
- The Well-Calibrated Bayesian
- Three problems in learning mixed-strategy Nash equilibria
- Universal prediction of individual sequences
Cited in
(43)- Learning, hypothesis testing, and Nash equilibrium.
- Regret-based continuous-time dynamics.
- A wide range no-regret theorem
- Regret in the on-line decision problem
- Calibrated forecasting and merging
- Belief-based equilibrium
- Learning purified mixed equilibria
- Transferable deposits as a screening mechanism
- On the empirical relevance of correlated equilibrium
- Learning in nonatomic games. I: Finite action spaces and population games
- Constrained no-regret learning
- Bounding the inefficiency of outcomes in generalized second price auctions
- Correlated equilibria in homogeneous good Bertrand competition
- A unifying learning framework for building artificial game-playing agents
- Exploitable actions of believers in the ``law of small numbers in repeated constant-sum games
- Learning correlated equilibria in games with compact sets of strategies
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
- Learning in perturbed asymmetric games
- Approachability with bounded memory
- Dynamic benchmark targeting
- Approachability, regret and calibration: implications and equivalences
- A general internal regret-free strategy
- Recency, consistent learning, and Nash equilibrium
- Supermartingales in Prediction with Expert Advice
- Calibration and internal no-regret with random signals
- Regret matching with finite memory
- scientific article; zbMATH DE number 7626715 (Why is no real title available?)
- Learning in Games
- Efficient testing of forecasts
- A continuous-time approach to online optimization
- Note on universal conditional consistency
- Internal regret in on-line portfolio selection
- Internal regret in on-line portfolio selection
- A general class of adaptive strategies
- No-regret algorithms in on-line learning, games and convex optimization
- Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium
- Nested replicator dynamics, nested logit choice, and similarity-based learning
- Consistency and cautious fictitious play
- Algorithmic collusion and a Folk theorem from learning with bounded rationality
- Replicator dynamics: old and new
- Approachability with delayed information
- Regret minimization in repeated matrix games with variable stage duration
- Exponential weight algorithm in continuous time
This page was built for publication: Conditional universal consistency.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818287)
