SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online decision problems with large strategy sets
16 references·0 citing·34 second hop
Online decision problems with large strategy sets (2005)Online decision problems with large strat…The value of knowing a demand curve: bounds on regret for online posted-price auctions (2004)The value of knowing a demand…The Sample Complexity of Exploration in the Multi-Armed Bandit Problem (2004)The Sample Complexity of Expl…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…The Eigentrust algorithm for reputation management in P2P networks (2003)The Eigentrust algorithm for …Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Collaborative reputation mechanisms in electronic marketplaces (2003)Collaborative reputation mech…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …A Social Mechanism of Reputation Management in Electronic Communities (2000)A Social Mechanism of Reputat…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…The Multi-Armed Bandit Problem: Decomposition and Computation (1987)The Multi-Armed Bandit Proble…Bandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Multi-Armed Bandits and the Gittins Index (1980)Multi-Armed Bandits and the G…A two-armed bandit theory of market pricing (1974)A two-armed bandit theory of …Stochastic Estimation of the Maximum of a Regression Function (1952)Stochastic Estimation of the …Bandit Processes and Dynamic Allocation Indices (1979)Extensions of the multiarmed bandit problem: The discounted case (1985)KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Multi-armed bandits in metric spaces (2008)Linearly Parameterized Bandits (2010)Introduction to Stochastic Programming (2011)A Stochastic Approximation Method (1951)Acceleration of Stochastic Approximation by Averaging (1992)Multivariate stochastic approximation using a simultaneous perturbation gradient approximation (1992)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)The Economics of Information (1961)A model of price adjustment (1971)Micro-Economic Foundations of Employment and Inflation Theory. (1972)Bargains and Ripoffs: A Model of Monopolistically Competitive Price Dispersion (1977)Chapter 15 Job search and labor market analysis (1986)Trust as a commodity (1988)Some aspects of the sequential design of experiments (1952)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)The Theory of Learning in Games (1998)Ad click prediction (2013)Contributions to the theory of games. (1960)How to use expert advice (1997)Algorithms for portfolio management based on the Newton method (2006)Combinatorial bandits (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Prediction, Learning, and Games (2006)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)Learning by Doing and the Choice of Technology (1996)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities (2004)A survey of trust and reputation systems for online service provision (2005)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
  • 2003The Eigentrust algorithm for reputation management in P2P networks3,361 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1952Stochastic Estimation of the Maximum of a Regression Function2,134 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 1974A two-armed bandit theory of market pricing617 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient599 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 1987Bandit Problems, Sequential Allocation of Experiments.566 cited
  • 1980Multi-Armed Bandits and the Gittins Index515 cited
  • 2000A Social Mechanism of Reputation Management in Electronic Communities464 cited
  • 1987The Multi-Armed Bandit Problem: Decomposition and Computation333 cited
  • 2003Collaborative reputation mechanisms in electronic marketplaces331 cited
  • 2004The Sample Complexity of Exploration in the Multi-Armed Bandit Problem309 cited
  • 2004The value of knowing a demand curve: bounds on regret for online posted-price auctions

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

296 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • Cited by

    No citing works inside the corpus for this window.