02030101 TMBA TMBA #tm_1th_2 > li:nth-child(3) > ul > li.toy_0 > a 02030101 TMBA TMBA #mprovide > div > div > div.box.box1 > ul > li:nth-child(1) > a 02030201 IMBA IMBA #tm_1th_2 > li:nth-child(3) > ul > li.toy_1 > a 02030201 IMBA IMBA #mprovide > div > div > div.box.box1 > ul > li:nth-child(2) > a 02030301 EMBA EMBA #tm_1th_2 > li:nth-child(3) > ul > li.toy_2 > a 02030301 EMBA EMBA #mprovide > div > div > div.box.box1 > ul > li:nth-child(4) > a 02030401 PMBA PMBA #tm_1th_2 > li:nth-child(3) > ul > li.last.toy_3 > a 02030401 PMBA PMBA #mprovide > div > div > div.box.box1 > ul > li:nth-child(3) > a 02040101 FMBA FMBA #tm_1th_2 > li:nth-child(4) > ul > li.toy_0 > a 02040101 FMBA FMBA #mprovide > div > div > div.box.box3 > ul > li:nth-child(1) > a 02040201 MFE MFE #tm_1th_2 > li:nth-child(4) > ul > li.toy_1 > a 02040201 MFE MFE #mprovide > div > div > div.box.box3 > ul > li:nth-child(3) > a 02040401 IMMBA IMMBA #tm_1th_2 > li:nth-child(4) > ul > li.toy_2 > a 02040401 IMMBA IMMBA #mprovide > div > div > div.box.box3 > ul > li:nth-child(2) > a 02040501 IMMS IMMS #tm_1th_2 > li:nth-child(4) > ul > li.toy_3 > a 02040501 IMMS IMMS #mprovide > div > div > div.box.box3 > ul > li:nth-child(4) > a 02040601 SEMBA SEMBA #tm_1th_2 > li:nth-child(4) > ul > li.toy_4 > a 02040601 SEMBA SEMBA #mprovide > div > div > div.box.box3 > ul > li:nth-child(6) > a 02040701 GP GP #tm_1th_2 > li:nth-child(4) > ul > li.last.toy_5 > a 02040701 GP GP #mprovide > div > div > div.box.box3 > ul > li:nth-child(7) > a 02040701 admission admission #txt > div.sub0303.mt_20 > div.btn_wrap > a 02040701 GP GP #mprovide > div > div > div.box.box3 > ul > li:nth-child(7) > a
본문 바로가기 사이트 메뉴 바로가기 주메뉴 바로가기

Constrained contests with a continuum of battles

GAMES AND ECONOMIC BEHAVIOR2023-11

Hwang, Sung-Ha | Koh, Youngwoo | Lu, Jingfeng

We study a contest problem in which two players compete on a continuum of battlefields by spending resources subject to some constraints on their strategies. Following Myerson (1993), we assume that each player's resource allocation on each battlefield is an independent random draw from the same distribution. Within each battlefield, the player who allocates a higher level of resources wins, but both players incur costs for resource allocation. To analyze this problem, we introduce a systematic way to identify equilibrium allocation strategies and show that any equilibrium strategy of a player renders the rival indifferent in terms of the “constraint-adjusted payoff”. Using this, we provide a complete characterization of equilibrium allocation strategies. We also show that whereas a symmetric budget constraint may induce players to spend more resources than in the case with no constraint, asymmetric budgets that are proportional to players' values of winning would eliminate this possibility.

Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
Issue Date
2023-11
Article Type
Article
Citation
GAMES AND ECONOMIC BEHAVIOR, Vol.142, pp.992 - 1011
ISSN
0899-8256
DOI
10.1016/j.geb.2023.10.011
만족도조사

이 페이지에서 제공하는 정보에 대하여 만족하십니까?

콘텐츠담당자 : 주선희 연락처 : 02-958-3602

교수 & 연구

관심자등록

KCB ISSUE