請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/97361完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 林忠緯 | zh_TW |
| dc.contributor.advisor | Chung-Wei Lin | en |
| dc.contributor.author | 郭柏廷 | zh_TW |
| dc.contributor.author | Bo-Ting Guo | en |
| dc.date.accessioned | 2025-05-07T16:11:19Z | - |
| dc.date.available | 2025-05-08 | - |
| dc.date.copyright | 2025-05-07 | - |
| dc.date.issued | 2025 | - |
| dc.date.submitted | 2025-04-22 | - |
| dc.identifier.citation | L. Csat´o, “Mitigating the risk of tanking in multi-stage tournaments,” Annals of Operations Research, Oct. 2024.
S. Vardi, “On tanking and competitive balance: Reconciling conflicting incentives,” 2020. L. Csat´o, “A paradox of tournament seeding,” International Journal of Sports Science & Coaching, vol. 18, no. 4, pp. 1277–1284, 2023. W. Stronka, “Anti-tanking pair matching before an elimination phase of a two-phase tournament,” Economies, vol. 8, no. 3, 2020. P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Machine Learning, vol. 47, pp. 235–256, May 2002. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/97361 | - |
| dc.description.abstract | 中華職棒由於其賽程、賽制的設計,將一整年的比賽分為上、下半季進行,於 2017 年時出現了有隊伍能夠藉由輸掉比賽得到晉級機會的情形,雖然中華職棒在 2022 年採用了新賽制,但是時至今日,已採用新賽制的中華職棒,這個現象仍然有可能發生。
我們的論文提出了以樹的結構方式分析中華職棒的賽程,並提出方法找出可能有輸家得利發生的時機點。我們設計了一些實驗來測試加速分析方式的有效性。我們也成功用 2017 年的賽程驗證了程式結果,並且以此方法於中華職棒 2017~2023 年的賽程來比較新賽制與舊賽制何者較容易導致輸家得利,也成功找出了新賽制在 2023 年其實有可能比舊賽制差的情形。 我們提出一些計算賽程損失的方式,以可能發生輸家得利的程度來比較賽程的好壞,並設計了一些實驗比較這些損失函數的好壞。並且透過了模擬退火法來搭配我們的分析方法及賽程的損失,試圖重新調整中華職棒因雨延賽後的賽程,減少中華職棒發生輸家得利的可能性。 | zh_TW |
| dc.description.abstract | The Chinese Professional Baseball League (CPBL) divides its annual games into two halves, adopting a unique schedule and format. In 2017, a situation occurred where a team could advance to the playoffs by intentionally losing a game. Although the CPBL introduced a new format in 2022, this phenomenon remains possible even under the current system.
This thesis proposes a tree-structured approach to analyze the CPBL schedule and identifies scenarios where losing may lead to an advantage. We designed experiments to test the effectiveness of accelerated analysis approaches. Our approach successfully verified the results using the 2017 schedule. Additionally, we applied this method to schedules from 2017 to 2023, comparing the likelihood of “tanking for playoff” under the new and old formats. Interestingly, we identified cases where the new format could potentially perform worse than the old format in 2023. We also proposed several approaches for calculating schedule loss to evaluate the quality of a schedule based on the occurrence of “tanking for playoff.” Experiments were conducted to compare these loss indices. By integrating our analytical approaches with simulated annealing, we attempted to reschedule CPBL games affected by rain, aiming to reduce the occurrence of "tanking for playoff." | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-05-07T16:11:19Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2025-05-07T16:11:19Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | Acknowledgements i
摘要 ii Abstract iv Contents vi List of Tables viii List of Figures ix 1 Introduction 1 2 Related Works 5 3 Definitions and Problem Formulation 7 3.1 2022 New Format . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 2009 Old Format . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.3 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3.1 Loss Function . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3.2 Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 4 Approaches 18 4.1 Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.1.1 Basic Approach . . . . . . . . . . . . . . . . . . . . . . . . . . 19 4.1.2 Dynamic Programming Based Approach . . . . . . . . . . . . 20 4.1.3 Monte Carlo Tree Search (MCTS) Based Approach . . . . . . 22 4.2 Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 4.2.1 Loss Index: Slope . . . . . . . . . . . . . . . . . . . . . . . . . 24 4.2.2 Loss Index: Weight . . . . . . . . . . . . . . . . . . . . . . . . 25 4.2.3 Loss Index: Mix . . . . . . . . . . . . . . . . . . . . . . . . . . 26 4.2.4 Simulated Annealing . . . . . . . . . . . . . . . . . . . . . . . 27 5 Experiment Results 29 5.1 Experiment 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 5.2 Experiment 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 5.3 Experiment 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 6 Case Study: CPBL Past Schedules 35 6.1 Comparison of the New Format and the Old Format . . . . . . . . . . 35 6.2 Rescheduling Rain-Postponed Games . . . . . . . . . . . . . . . . . . 42 7 Conclusion 45 Bibliography 47 A Results Figures 48 | - |
| dc.language.iso | zh_TW | - |
| dc.subject | 蒙地卡羅樹搜索 | zh_TW |
| dc.subject | 賽程比較 | zh_TW |
| dc.subject | 模擬退火 | zh_TW |
| dc.subject | 賽程最佳化 | zh_TW |
| dc.subject | 賽程分析 | zh_TW |
| dc.subject | schedule comparison | en |
| dc.subject | schedule analysis | en |
| dc.subject | schedule optimization | en |
| dc.subject | simulated annealing | en |
| dc.subject | Monte Carlo tree search | en |
| dc.title | 避免輸家得利之賽程分析與最佳化 | zh_TW |
| dc.title | Analyzing and Optimizing Tournament Schedules against “Tanking for Playoff” | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 113-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 江介宏;吳育任;蔡益坤 | zh_TW |
| dc.contributor.oralexamcommittee | Jie-Hong Jiang;Yuh-Renn Wu;Yih-Kuen Tsay | en |
| dc.subject.keyword | 賽程分析,賽程最佳化,模擬退火,蒙地卡羅樹搜索,賽程比較, | zh_TW |
| dc.subject.keyword | schedule analysis,schedule optimization,simulated annealing,Monte Carlo tree search,schedule comparison, | en |
| dc.relation.page | 58 | - |
| dc.identifier.doi | 10.6342/NTU202500830 | - |
| dc.rights.note | 同意授權(限校園內公開) | - |
| dc.date.accepted | 2025-04-23 | - |
| dc.contributor.author-college | 電機資訊學院 | - |
| dc.contributor.author-dept | 資訊工程學系 | - |
| dc.date.embargo-lift | 2025-05-08 | - |
| 顯示於系所單位: | 資訊工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-113-2.pdf 授權僅限NTU校內IP使用(校園外請利用VPN校外連線服務) | 2.14 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
