Manipulation of moves in sequential contests

被引:0
|
作者
Protopappas, Konstantinos [1 ]
机构
[1] Univ Innsbruck, Dept Publ Finance, Univ Str 15, A-6020 Innsbruck, Austria
关键词
STRATEGIC BEHAVIOR; RENT-SEEKING; REIMBURSEMENT; INFORMATION;
D O I
10.1007/s00355-023-01461-7
中图分类号
F [经济];
学科分类号
02 ;
摘要
In two-player Tullock contests with endogenous timing of moves, the weak player moves early and the strong player follows. This order of moves is the third-best outcome for a contest organiser as it leads to a contest with lower aggregate effort compared to a contest where the players move in reverse order (first best) or simultaneously (second best). We propose that if the contest organiser-who does not know ex ante which player is the strong and which is the weak one-offers a lower price (effort cost) to the player(s) who choose(s) to exert effort early, she can achieve a greater payoff by affecting the contestants' sequence of moves. We show that there exists no price that generates the first-best outcome. However, there is a price (or a range of prices) that induces both players to move early and receive it, leading to the second-best outcome. We also discuss the case where both players move early but only one receives the low price, e.g., lobbying or Instagram "giveaway" contests.
引用
收藏
页码:511 / 535
页数:25
相关论文
共 50 条
  • [31] Prediction of Poker Moves Using Sequential Model and TensorFlow
    Radziukas, Raulis
    Maskeliunas, Rytis
    Damasevicius, Robertas
    [J]. INFORMATION AND SOFTWARE TECHNOLOGIES, ICIST 2019, 2019, 1078 : 516 - 525
  • [32] Asymmetric Complementary Goods Pricing under Sequential Moves
    Cheng, Leonard K.
    Nahm, Jae
    [J]. B E JOURNAL OF ECONOMIC ANALYSIS & POLICY, 2010, 10 (01):
  • [33] A hierarchical graph model for conflict resolution with sequential moves
    He, Shawei
    Hipel, Keith W.
    [J]. INFOR, 2019, 57 (02) : 204 - 225
  • [34] The complexity of online manipulation of sequential elections
    Hemaspaandra, Edith
    Hemaspaandra, Lane A.
    Rothe, Joerg
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (04) : 697 - 710
  • [35] Detecting and Recovering Sequential DeepFake Manipulation
    Shao, Rui
    Wu, Tianxing
    Liu, Ziwei
    [J]. COMPUTER VISION, ECCV 2022, PT XIII, 2022, 13673 : 712 - 728
  • [36] SUM: Sequential Scene Understanding and Manipulation
    Sui, Zhiqiang
    Zhou, Zheming
    Zeng, Zhen
    Jenkins, Odest Chadwicke
    [J]. 2017 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2017, : 3281 - 3288
  • [37] Sequential Manipulation Planning on Scene Graph
    Jiao, Ziyuan
    Niu, Yida
    Zhang, Zeyu
    Zhu, Song-Chun
    Zhu, Yixin
    Liu, Hangxin
    [J]. 2022 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2022, : 8203 - 8210
  • [38] Designing practical and fair sequential team contests: The case of penalty shootouts
    Anbarci, Nejat
    Sun, Ching-Jen
    Unver, M. Utku
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2021, 130 : 25 - 43
  • [39] Contests, Managerial Incentives, Stock Price Manipulation, and Advance Selling Strategies: Introduction
    Qin, Cheng-Zhong
    [J]. PACIFIC ECONOMIC REVIEW, 2013, 18 (02) : 162 - 163
  • [40] New Hampshire Effect: behavior in sequential and simultaneous multi-battle contests
    Shakun D. Mago
    Roman M. Sheremeta
    [J]. Experimental Economics, 2019, 22 : 325 - 349