On the public citation graph
Bayesian Incentive-Compatible Bandit Exploration
0 signed · 94 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9780470980033openalex-snapshot
Multi‐Armed Bandit Allocation Indices
inferredcites →https://doi.org/10.1007/3-540-45435-7_18openalex-snapshot
PAC Bounds for Multi-armed Bandit and Markov Decision Processes
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-snapshot
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1016/j.cell.2012.02.041openalex-snapshot
Redefining Clinical Trials: The Age of Personalized Medicine
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.059openalex-snapshot
Pure exploration in finitely-armed and continuous-armed bandits
inferredcites →https://doi.org/10.1016/s0140-6736(14)61122-3openalex-snapshot
More multiarm randomised trials of superiority are needed
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/a:1006556606079openalex-snapshot
The Racing Algorithm: Model Selection for Lazy Learners
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1080/01621459.1979.10481033openalex-snapshot
A One-Armed Bandit Problem with a Concomitant Variable
inferredcites →https://doi.org/10.1086/676597openalex-snapshot
Implementing the “Wisdom of the Crowd”
inferredcites →https://doi.org/10.1089/big.2016.0047openalex-snapshot
Fair Prediction with Disparate Impact: A Study of Bias in Recidivism Prediction Instruments
inferredcites →https://doi.org/10.1093/biomet/25.3-4.285openalex-snapshot
ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES
inferredcites →https://doi.org/10.1093/jnci/djm022openalex-snapshot
Biomarker-Adaptive Threshold Design: A Procedure for Evaluating Treatment With Possible Biomarker-Defined Subset Effect
inferredcites →https://doi.org/10.1109/sfcs.2003.1238232openalex-snapshot
The value of knowing a demand curve: bounds on regret for online posted-price auctions
inferredcites →https://doi.org/10.1109/tac.2005.844079openalex-snapshot
Bandit problems with side observations
inferredcites →https://doi.org/10.1111/j.0006-341x.2001.00892.xopenalex-snapshot
Monitoring Clinical Trials with Multiple Arms
inferredcites →https://doi.org/10.1111/j.1468-0262.2005.00564.xopenalex-snapshot
Strategic Experimentation with Exponential Bandits
inferredcites →https://doi.org/10.1111/j.2517-6161.1979.tb01068.xopenalex-snapshot
Bandit Processes and Dynamic Allocation Indices
inferredcites →https://doi.org/10.1137/1.9781611973068.3openalex-snapshot
The Ratio Index for Budgeted Learning, with Applications
inferredcites →https://doi.org/10.1137/120878768openalex-snapshot
Characterizing Truthful Multi-armed Bandit Mechanisms
inferredcites →https://doi.org/10.1137/s0097539701398375openalex-snapshot
The Nonstochastic Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1145/1250790.1250807openalex-snapshot
Approximation algorithms for budgeted learning problems
inferredcites →https://doi.org/10.1145/1566374.1566388openalex-snapshot
The price of truthfulness for pay-per-click auctions
inferredcites →https://doi.org/10.1145/1807342.1807349openalex-snapshot
Truthful mechanisms with implicit payment computation
inferredcites →https://doi.org/10.1145/2229012.2229023openalex-snapshot
Dynamic pricing with limited supply
inferredcites →https://doi.org/10.1145/2422436.2422465openalex-snapshot
Learning and incentives in user-generated content
inferredcites →https://doi.org/10.1145/2488388.2488490openalex-snapshot
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms
inferredcites →https://doi.org/10.1145/2692359.2692364openalex-snapshot
Online decision making in crowdsourcing markets
inferredcites →https://doi.org/10.1145/2940716.2940719openalex-snapshot
Economic Recommendation Systems
inferredcites →https://doi.org/10.1145/3033274.3085154openalex-snapshot
Fairness Incentives for Myopic Agents
inferredcites →https://doi.org/10.1145/3308558.3313649openalex-snapshot
Bayesian Exploration with Heterogeneous Agents
inferredcites →https://doi.org/10.1158/1078-0432.ccr-05-0605openalex-snapshot
Adaptive Signature Design: An Adaptive Clinical Trial Design for Generating and Prospectively Testing A Gene Expression Signature for Sensitive Patients
inferredcites →https://doi.org/10.1158/1078-0432.ccr-08-0325openalex-snapshot
Multi-Arm Clinical Trials of New Agents: Some Design Considerations
inferredcites →https://doi.org/10.1158/1078-0432.ccr-09-1357openalex-snapshot
The Cross-Validated Adaptive Signature Design
inferredcites →https://doi.org/10.1184/r1/6555050openalex-snapshot
Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation
inferredcites →https://doi.org/10.1186/1750-1172-3-11openalex-snapshot
Adaptive design methods in clinical trials – a review
inferredcites →https://doi.org/10.1200/jco.2014.59.8433openalex-snapshot
Basket Trials and the Evolution of Clinical Trial Design in an Era of Genomic Medicine
inferredcites →https://doi.org/10.1287/moor.2014.0663openalex-snapshot
Partial Monitoring—Classification, Regret Bounds, and Algorithms
inferredcites →https://doi.org/10.1287/opre.1080.0640openalex-snapshot
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
inferredcites →https://doi.org/10.1287/opre.2013.1194openalex-snapshot
Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism
inferredcites →https://doi.org/10.1287/opre.2021.2205openalex-snapshot
Bayesian Exploration: Incentivizing Exploration in Bayesian Games
inferredcites →https://doi.org/10.1561/9781601986276openalex-snapshot
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
inferredcites →https://doi.org/10.1613/jair.4940openalex-snapshot
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
inferredcites →https://doi.org/10.2139/ssrn.2600931openalex-snapshot
Optimal Design for Social Learning
inferredcites →https://doi.org/10.2139/ssrn.2714940openalex-snapshot
Information Design, Bayesian Persuasion and Bayes Correlated Equilibrium
inferredcites →https://doi.org/10.2307/2982809openalex-snapshot
Multi-Armed Bandit Allocation Indices.
inferredcites →https://doi.org/10.3322/caac.20135openalex-snapshot
Clinical trials in the era of personalized oncology
inferredcites →https://doi.org/10.48550/arxiv.1105.4871openalex-snapshot
Minimax Policies for Combinatorial Prediction Games
inferredcites →https://doi.org/10.48550/arxiv.1402.0555openalex-snapshot
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
inferredcites →https://doi.org/10.48550/arxiv.1502.07617openalex-snapshot
Online Learning with Feedback Graphs: Beyond Bandits
inferredcites →https://doi.org/10.48550/arxiv.1605.07139openalex-snapshot
Fairness in Learning: Classic and Contextual Bandits
inferredcites →https://doi.org/10.5555/1005332.1005355openalex-snapshot
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4733191openalex-extracted
Incentivized Exploration via Filtered Posterior Sampling
inferred← citeshttps://doi.org/10.1007/978-3-032-03639-1_21openalex-snapshot
Near-Linear MIR Algorithms for Stochastically-Ordered Priors
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103821openalex-snapshot
Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.09.035openalex-snapshot
A jump–diffusion Stackelberg stochastic differential game in optimal carbon abatement strategies with green subsidy
inferred← citeshttps://doi.org/10.1016/j.jet.2026.106150openalex-snapshot
Information design for social learning on a recommendation platform
inferred← citeshttps://doi.org/10.1093/jrsssb/qkad111openalex-snapshot
Jiayi Li, Yuantong Li and Xiaowu Dai's contribution to the Discussion of ‘Estimating means of bounded random variables by betting' by Waudby-Smith and Ramdas
inferred← citeshttps://doi.org/10.1093/qje/qjx044openalex-snapshot
Recommender Systems as Mechanisms for Social Learning*
inferred← citeshttps://doi.org/10.1109/tmc.2025.3555971openalex-snapshot
Competitive Multi-Armed Bandit Games for Resource Sharing
inferred← citeshttps://doi.org/10.1145/3465456.3467549openalex-snapshot
The Price of Incentivizing Exploration
inferred← citeshttps://doi.org/10.1145/3674158openalex-snapshot
Incentive-Aware Recommender Systems in Two-Sided Markets
inferred← citeshttps://doi.org/10.1145/3704413.3764461openalex-snapshot
Human-in-the-loop Learning Through Decentralized Communication Mechanisms
inferred← citeshttps://doi.org/10.1145/3736252.3742677openalex-snapshot
Asymptotically Efficient Distributed Experimentation
inferred← citeshttps://doi.org/10.1287/mnsc.2022.00893openalex-snapshot
On Statistical Discrimination as a Failure of Social Learning: A Multiarmed Bandit Approach
inferred← citeshttps://doi.org/10.1287/opre.2021.2205openalex-snapshot
Bayesian Exploration: Incentivizing Exploration in Bayesian Games
inferred← citeshttps://doi.org/10.1287/opre.2022.0495openalex-snapshot
Exploration and Incentives in Reinforcement Learning
inferred← citeshttps://doi.org/10.1287/opre.2022.2401openalex-snapshot
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity
inferred← citeshttps://doi.org/10.1371/journal.pone.0299086openalex-snapshot
Incentive-compatible mechanism for manufacturing carbon emission supervision under carbon control policies in China
inferred← citeshttps://doi.org/10.1561/2200000068openalex-snapshot
Introduction to Multi-Armed Bandits
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21178openalex-snapshot
Learning the Optimal Recommendation from Explorative Users
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25706openalex-snapshot
Competition, Alignment, and Equilibria in Digital Marketplaces
inferred← citeshttps://doi.org/10.1613/jair.1.14126openalex-snapshot
Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
inferred← citeshttps://doi.org/10.2139/ssrn.4275515openalex-snapshot
Information Design for Social Learning on a Recommendation Platform
inferred← citeshttps://doi.org/10.2139/ssrn.4365381openalex-snapshot
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
inferred← citeshttps://doi.org/10.2139/ssrn.5006666openalex-snapshot
Designing Pandora's Box: Product Rankings and Marketplace Participation
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867382openalex-snapshot
Collaborative Multi-agent Stochastic Linear Bandits
inferred← citeshttps://doi.org/10.23919/acc60939.2024.10644966openalex-snapshot
Incentivized Exploration of Non-Stationary Stochastic Bandits
inferred← citeshttps://doi.org/10.48550/arxiv.1503.05988openalex-snapshot
Algorithmic Bayesian Persuasion
inferred← citeshttps://doi.org/10.48550/arxiv.2109.12445openalex-snapshot
Algorithmic Information Design in Multi-Player Games: Possibility and Limits in Singleton Congestion
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.