Pricing problems with Thompson sampling
In 1933, William R. Thompson proposed an algorithm known as Thompson sampling in order to maximise culmulative payo in a multi-armed bandit (MAB) problem. MAB problems have been fre- quently used to model real-life decision making scenarios. This pa- per explores the extension of Thompson sampl...
Saved in:
Main Author: | Lee, Samuel Wai Leong |
---|---|
Other Authors: | Yan Zhenzhen |
Format: | Final Year Project |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/77144 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Universality for the largest eigenvalue of sample covariance matrices with general population
by: Bao, Zhigang, et al.
Published: (2015) -
Central limit theorem for the spiked eigenvalues of separable sample covariance matrices
by: Zhang, Bo
Published: (2017) -
Geometry of sample spaces
by: Harms, Philipp, et al.
Published: (2023) -
Sample size estimation with missing values on clinical trials
by: Zhang, Mengyang
Published: (2019) -
State-Aware Variational Thompson Sampling for Deep Q-Networks
by: WEE SUN LEE, et al.
Published: (2021)