Budget-constrained multi-battle contests: A new perspective and analysis

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2018-04-18

類型

期刊名稱

THEORETICAL COMPUTER SCIENCE

卷期與頁次

第 721 卷,頁 16–26

ISSN

0304-3975

語言

英文

摘要

In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multiple battles to fight, and the budgets get consumed over time. The final winner in the overall contest is the one who first reaches some amount of total value. Examples include R & D races, sports competition, elections, and many more. A player needs to make adequate sequential actions to win the contest against dynamic competition over time from the others. We are interested in how much budgets the players would need and what actions they should take in order to perform well. We model and study such budget-constrained multi-battle contests where each component battle is a sequential first-price or all-pay auction. We focus on analyzing the 2-player budget ratio that guarantees a player's winning against the other omnipotent player. In the settings considered, we find the optimal budget ratios and the corresponding bidding strategies. Our definition of game, budget constraints, and emphasis on budget analyses provide a new perspective and analysis for multi-battle contests. (C) 2018 Elsevier B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Cheng, C.-H., Chen, P.-A., & Hon, W.-K. (2018). Budget-constrained multi-battle contests: A new perspective and analysis. THEORETICAL COMPUTER SCIENCE, 721, 16–26. https://doi.org/10.1016/j.tcs.2018.01.018

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144828