SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks
14 references·0 citing·38 second hop
A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks (2015)A Truthful Budget Feasible Multi-Armed Ba…Knapsack Based Optimal Policies for Budget–Limited Multi–Armed Bandits (2021)Knapsack Based Optimal Polici…Bandits with concave rewards and convex knapsacks (2014)Bandits with concave rewards …Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Learning on a budget (2012)Learning on a budgetEfficient Crowdsourcing of Unknown Experts using Multi-Armed Bandits (2012)Efficient Crowdsourcing of Un…Regret bounds for sleeping experts and bandits (2010)Regret bounds for sleeping ex…Budget Feasible Mechanisms (2010)Budget Feasible MechanismsThe price of truthfulness for pay-per-click auctions (2009)The price of truthfulness for…Characterizing truthful multi-armed bandit mechanisms (2009)Characterizing truthful multi…Approximation algorithms for budgeted learning problems (2007)Approximation algorithms for …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Truthful mechanisms for one-parameter agents (2001)Truthful mechanisms for one-p…Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)Sample mean based index polic…Optimal Auction Design (1981)Optimal Auction DesignSome aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Mortal Multi-Armed Bandits (2008)An Asymptotically Optimal Bandit Algorithm for Bounded Support Models. (2010)Multi-armed bandits with application to 5G small cells (2016)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)A Theory of Auctions and Competitive Bidding (1982)Efficient mechanisms for bilateral trading (1983)The interdisciplinary study of coordination (1994)A desicion-theoretic generalization of on-line learning and an application to boosting (1995)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Linear Contextual Bandits with Knapsacks (2015)Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems (2016)Bandits and Experts in Metric Spaces (2019)A Stochastic Approximation Method (1951)Prediction, Learning, and Games (2006)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Introduction to Multi-Armed Bandits (2019)Algorithmic Mechanism Design (2001)On the approximability of budget feasible mechanisms (2011)Selling privacy at auction (2013)Social Choice and Individual Values. (1951)A Course in Game Theory (1994)Towards a characterization of truthful combinatorial auctions (2004)Truthful approximation mechanisms for restricted combinatorial auctions (2008)Approximate mechanism design without money (2009)Algorithmic Game Theory (2007)Learning Prices for Repeated Auctions with Strategic Buyers (2013)Mean Field Equilibria of Dynamic Auctions with Learning (2014)Mechanism Design and Approximation (2014)Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Efficient crowdsourcing of unknown experts using bounded multi-armed bandits (2014)Bandits with Knapsacks (2018)Linearly Parameterized Bandits (2010)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1981Optimal Auction Design5,938 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
  • 2001Truthful mechanisms for one-parameter agents521 cited
  • 2010Budget Feasible Mechanisms296 cited
  • 2010Regret bounds for sleeping experts and bandits200 cited
  • 2021Knapsack Based Optimal Policies for Budget–Limited Multi–Armed Bandits154 cited
  • 2014Bandits with concave rewards and convex knapsacks122 cited
  • 2009The price of truthfulness for pay-per-click auctions116 cited
  • 2012Learning on a budget113 cited
  • 2009Characterizing truthful multi-armed bandit mechanisms89 cited
  • 2007Approximation algorithms for budgeted learning problems85 cited
  • 2012Efficient Crowdsourcing of Unknown Experts using Multi-Armed Bandits78 cited

Cited by

No citing works inside the corpus for this window.

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