Multi-Armed Exponential Bandit
Exponential bandits are widely adopted in economics and marketing due to their tractability. This paper analyzes the one-agent multi-armed account of exponential bandits, where the agent dynamically selects arms to maximize total payoff. We motivate our base model by examples with arms being of the same type, while the results are generalized to cases where arms are either independent or dependent. The contribution is fourfold. First, we characterize the optimal policy for the agent to choose arms. Under the optimal policy, the agent selects one arm each time, and an arm is used at most once. Second, we show that the agent may not regard information acquisition as a last-ditch effort before quitting, which contradicts the existing literature. Third, with a discount factor, an arm may be used more than once. Fourth, for the case of negatively correlated bandits, the agent may use more than one arms simultaneously. The paper is of both theoretical and practical significance since the model fits well with various situations, including project selection, product promotion, and drug development. Implications for these applications are discussed.
| Medienart: |
E-Book |
|---|
| Erscheinungsjahr: |
[2021] |
|---|---|
| Erschienen: |
S.l.: SSRN ; 2021 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Chen, Kanglin [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments November 3, 2020 erstellt |
|---|
| Umfang: |
1 Online-Ressource (36 p) |
|---|
| doi: |
10.2139/ssrn.3724377 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
1806671220 |
|---|
| LEADER | 01000cam a2200265 4500 | ||
|---|---|---|---|
| 001 | 1806671220 | ||
| 003 | DE-627 | ||
| 005 | 20230915113805.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 220609s2021 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.2139/ssrn.3724377 |2 doi | |
| 035 | |a (DE-627)1806671220 | ||
| 035 | |a (DE-599)KEP078153832 | ||
| 035 | |a (ELVSSRN)3724377 | ||
| 035 | |a (EBP)078153832 | ||
| 040 | |a DE-627 |b eng |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 100 | 1 | |a Chen, Kanglin |e verfasserin |0 (DE-588)1274097967 |0 (DE-627)1823815057 |4 aut | |
| 245 | 1 | 0 | |a Multi-Armed Exponential Bandit |
| 264 | 1 | |a [S.l.] |b SSRN |c [2021] | |
| 300 | |a 1 Online-Ressource (36 p) | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments November 3, 2020 erstellt | ||
| 506 | 0 | |a Open Access |e Controlled Vocabulary for Access Rights |u http://purl.org/coar/access_right/c_abf2 |f unrestricted online access | |
| 520 | |a Exponential bandits are widely adopted in economics and marketing due to their tractability. This paper analyzes the one-agent multi-armed account of exponential bandits, where the agent dynamically selects arms to maximize total payoff. We motivate our base model by examples with arms being of the same type, while the results are generalized to cases where arms are either independent or dependent. The contribution is fourfold. First, we characterize the optimal policy for the agent to choose arms. Under the optimal policy, the agent selects one arm each time, and an arm is used at most once. Second, we show that the agent may not regard information acquisition as a last-ditch effort before quitting, which contradicts the existing literature. Third, with a discount factor, an arm may be used more than once. Fourth, for the case of negatively correlated bandits, the agent may use more than one arms simultaneously. The paper is of both theoretical and practical significance since the model fits well with various situations, including project selection, product promotion, and drug development. Implications for these applications are discussed | ||
| 653 | 4 | |a multi-armed bandit |a experimentation |a exponential distribution |a information acquisition |a personalization | |
| 700 | 1 | |a Chen, Ying-Ju |e verfasserin |0 (DE-588)1302324616 |0 (DE-627)1859359620 |4 aut | |
| 700 | 1 | |a Gallego, Guillermo |e verfasserin |0 (DE-588)170929531 |0 (DE-627)061078395 |0 (DE-576)131767259 |4 aut | |
| 700 | 1 | |a Gao, Pin |e verfasserin |0 (DE-588)1247278603 |0 (DE-627)1780928807 |4 aut | |
| 700 | 1 | |a Liu, Haoyu |e verfasserin |4 aut | |
| 856 | 4 | 0 | |u https://ssrn.com/abstract=3724377 |m X:ELVSSRN |x Verlag |z kostenfrei |
| 856 | 4 | 0 | |u https://doi.org/10.2139/ssrn.3724377 |m X:ELVSSRN |x Resolving-System |z kostenfrei |
| 912 | |a ZDB-33-SFEN | ||
| 912 | |a ZDB-33-MRN | ||
| 912 | |a ZDB-33-ERN | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a ISIL_DE-206 | ||
| 912 | |a SYSFLAG_1 | ||
| 912 | |a GBV_KXP | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a ISIL_DE-705 | ||
| 912 | |a GBV_ILN_2403 | ||
| 912 | |a ISIL_DE-LFER | ||
| 951 | |a BO | ||
| 980 | |2 26 |1 01 |x 0206 |b 414868777X |h OLR-SSRN |y znz |z 12-06-22 | ||
| 980 | |2 60 |1 01 |x 0705 |b 4220170693 |h OA |k Bitte beachten Sie die Nutzungsbedingungen und Copyright-Bestimmungen des Verlages/Herausgebers! |k Freier Download |y z |z 25-11-22 | ||
| 980 | |2 2403 |1 01 |x DE-LFER |b 4224145669 |c 00 |f --%%-- |d --%%-- |e n |j --%%-- |y l01 |z 03-12-22 | ||
| 981 | |2 26 |1 01 |x 0206 |r https://doi.org/10.2139/ssrn.3724377 | ||
| 981 | |2 60 |1 01 |x 0705 |r https://doi.org/10.2139/ssrn.3724377 | ||
| 981 | |2 2403 |1 01 |x DE-LFER |r https://doi.org/10.2139/ssrn.3724377 | ||
| 981 | |2 2403 |1 01 |x DE-LFER |r https://ssrn.com/abstract=3724377 | ||
| 995 | |2 26 |1 01 |x 0206 |a OLR-SSRN | ||
| 995 | |2 60 |1 01 |x 0705 |a OA | ||