Learning in random utility models via online decision problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 3965301 (Why is no real title available?)
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- A general class of adaptive strategies
- Adaptive game playing using multiplicative weights
- An analog of the minimax theorem for vector payoffs
- Anticipating Regret: Why Fewer Options May Be Better
- Calibrated learning and correlated equilibrium
- Consistency and cautious fictitious play
- Convex Analysis
- Cupid's invisible hand: social surplus and identification in matching models
- DISCRETE CHOICE AND RATIONAL INATTENTION: A GENERAL EQUIVALENCE RESULT
- Discrete Choice Methods with Simulation
- Discrete choice prox-functions on the simplex
- First-order methods in optimization
- Identification in discrete choice models with imperfect information
- Learning in games via reinforcement and regularization
- Nontransitive measurable utility
- On the Global Convergence of Stochastic Fictitious Play
- Online learning and online convex optimization
- Perturbation techniques in online learning and optimization
- Potential-based algorithms in on-line prediction and game theory
- Prediction, Learning, and Games
- Rational inattention, optimal consideration sets, and stochastic choice
- Recency, consistent learning, and Nash equilibrium
- Regret aversion and opportunity dependence
- Regret in Decision Making under Uncertainty
- Regret in the on-line decision problem
- Regret-based continuous-time dynamics.
- Stochastic choice and revealed perturbed utility
- Stochastic optimization problems with nondifferentiable cost functionals
- Subjectivity and correlation in randomized strategies
- Technical note: On the relation between several discrete choice models
- The Baillon-Haddad theorem revisited
- The weighted majority algorithm
- Twenty lectures on algorithmic game theory
- Variational Analysis
This page was built for publication: Learning in random utility models via online decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885623)
