Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Ferreira, Kristine | - |
| dc.creator | Simchi-Levi, David | - |
| dc.creator | Wang, He | - |
| dc.date | 2022-05-24T13:18:51Z | - |
| dc.date | 2018-11 | - |
| dc.date | 2022-05-24T13:18:51Z | - |
| dc.date.accessioned | 2023-04-10T07:30:22Z | - |
| dc.date.available | 2023-04-10T07:30:22Z | - |
| dc.identifier | Ferreira, Kris J., David Simchi-Levi, and He Wang. "Online Network Revenue Management Using Thompson Sampling." Operations Research 66, no. 6 (November–December 2018): 1586–1602. | - |
| dc.identifier | 0030-364X | - |
| dc.identifier | https://nrs.harvard.edu/URN-3:HUL.INSTREPOS:37371710 | - |
| dc.identifier | 10.1287/opre.2018.1755 | - |
| dc.identifier | Ferreira, Kris J., David Simchi-Levi, and He Wang. "Online Network Revenue Management Using Thompson Sampling." Operations Research 66, no. 6 (November–December 2018): 1586–1602. | - |
| dc.identifier.uri | http://lib.yhn.edu.vn/handle/YHN/264 | - |
| dc.description | We consider a price-based network revenue management problem where a retailer aims to maximize revenue from multiple products with limited inventory over a finite selling season. As common in practice, we assume the demand function contains unknown parameters, which must be learned from sales data. In the presence of these unknown demand parameters, the retailer faces a tradeoff commonly referred to as the exploration-exploitation tradeoff. Towards the beginning of the selling season, the retailer may offer several different prices to try to learn demand at each price (“exploration” objective). Over time, the retailer can use this knowledge to set a price that maximizes revenue throughout the remainder of the selling season (“exploitation” objective). We propose a class of dynamic pricing algorithms that builds upon the simple yet powerful machine learning technique known as Thompson sampling to address the challenge of balancing the exploration-exploitation tradeoff under the presence of inventory constraints. Our algorithms prove to have both strong theoretical performance guarantees as well as promising numerical performance results when compared to other algorithms developed for similar settings. Moreover, we show how our algorithms can be extended for use in general multi-armed bandit problems with resource constraints, with applications in other revenue management settings and beyond. | - |
| dc.description | Author's Original | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.publisher | Institute for Operations Research and the Management Sciences (INFORMS) | - |
| dc.relation | https://doi.org/10.1287/opre.2018.1755 | - |
| dc.relation | Operations Research | - |
| dc.subject | Management Science and Operations Research | - |
| dc.subject | Computer Science Applications | - |
| dc.title | Online Network Revenue Management Using Thompson Sampling | - |
| dc.type | Journal Article | - |
| Appears in Collections | Tài liệu ngoại văn | |
Files in This Item:
