On the public citation graph

Incentivized Exploration via Filtered Posterior Sampling

https://doi.org/10.2139/ssrn.4733191
0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-34106-9_18openalex-extracted
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
inferredcites →https://doi.org/10.1007/s10994-010-5178-7openalex-extracted
Regret bounds for sleeping experts and bandits
inferredcites →https://doi.org/10.1016/0024-3795(94)00014-5openalex-extracted
Majorization relations for Hadamard products
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-extracted
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-extracted
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-extracted
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1086/676597openalex-extracted
Implementing the “Wisdom of the Crowd”
inferredcites →https://doi.org/10.1093/qje/qjx044openalex-extracted
Recommender Systems as Mechanisms for Social Learning*
inferredcites →https://doi.org/10.1109/ciss.2014.6814158openalex-extracted
Prior-free and prior-dependent regret bounds for Thompson Sampling
inferredcites →https://doi.org/10.1109/tit.2011.2104450openalex-extracted
A Note on Performance Limitations in Bandit Problems With Side Information
inferredcites →https://doi.org/10.1137/19m1247115openalex-extracted
Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits
inferredcites →https://doi.org/10.1145/2600057.2602897openalex-extracted
Incentivizing exploration
inferredcites →https://doi.org/10.1145/2764468.2764508openalex-extracted
Bayesian Incentive-Compatible Bandit Exploration
inferredcites →https://doi.org/10.1145/2940716.2940719openalex-extracted
Economic Recommendation Systems
inferredcites →https://doi.org/10.1145/3328526.3329569openalex-extracted
Social Learning and the Innkeeper's Challenge
inferredcites →https://doi.org/10.1145/3391403.3399487openalex-extracted
Incentivizing Exploration with Selective Data Disclosure
inferredcites →https://doi.org/10.1146/annurev-economics-080218-025739openalex-extracted
Bayesian Persuasion and Information Design
inferredcites →https://doi.org/10.1257/jel.20181489openalex-extracted
Information Design: A Unified Perspective
inferredcites →https://doi.org/10.1287/mnsc.2016.2697openalex-extracted
Crowdsourcing Exploration
inferredcites →https://doi.org/10.1287/mnsc.2020.3605openalex-extracted
Mostly Exploration-Free Algorithms for Contextual Bandits
inferredcites →https://doi.org/10.1287/moor.2014.0650openalex-extracted
Learning to Optimize via Posterior Sampling
inferredcites →https://doi.org/10.1287/opre.2019.1949openalex-extracted
Bayesian Incentive-Compatible Bandit Exploration
inferredcites →https://doi.org/10.1287/opre.2022.2401openalex-extracted
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity
inferredcites →https://doi.org/10.1561/2200000070openalex-extracted
A Tutorial on Thompson Sampling
inferredcites →https://doi.org/10.48550/arxiv.1110.2392openalex-extracted
A Variant of Azuma's Inequality for Martingales with Subgaussian Tails
inferredcites →https://doi.org/10.48550/arxiv.1111.1797openalex-extracted
Analysis of Thompson Sampling for the multi-armed bandit problem
inferredcites →https://doi.org/10.48550/arxiv.1403.5045openalex-extracted
Matroid Bandits: Fast Combinatorial Optimization with Learning
inferredcites →https://doi.org/10.48550/arxiv.1403.5341openalex-extracted
An Information-Theoretic Analysis of Thompson Sampling
inferredcites →https://doi.org/10.48550/arxiv.1703.00048openalex-extracted
Provably Optimal Algorithms for Generalized Linear Contextual Bandits
inferredcites →https://doi.org/10.48550/arxiv.2306.01990openalex-extracted
Incentivizing Exploration with Linear Contexts and Combinatorial Actions
inferredcites →https://doi.org/10.52202/068431-2694openalex-extracted
Incentivizing Combinatorial Bandit Exploration
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.