Stackelberg pricing games with congestion effects

• 成果类型: Article
• 署名作者: Harks, Tobias; Schedel, Anja
• 署名单位: University of Augsburg
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-021-01672-9
• 发表日期: 2024
• 页码: 763-799
• 关键词: Network design; Nash equilibria; part i; EXISTENCE; toll; COMPETITION; EFFICIENCY; complexity; pure

摘要

We study a Stackelberg game with multiple leaders and a continuum of followers that are coupled via congestion effects. The followers' problem constitutes a nonatomic congestion game, where a population of infinitesimal players is given and each player chooses a resource. Each resource has a linear cost function which depends on the congestion of this resource. The leaders of the Stackelberg game each control a resource and determine a price per unit as well as a service capacity for the resource influencing the slope of the linear congestion cost function. As our main result, we establish existence of pure-strategy Nash-Stackelberg equilibria for this multi-leader Stackelberg game. The existence result requires a completely new proof approach compared to previous approaches, since the leaders' objective functions are discontinuous in our game. As a consequence, best responses of leaders do not always exist, and thus standard fixed-point arguments a la Kakutani (Duke Math J 8(3):457-458, 1941) are not directly applicable. We show that the game is C-secure (a concept introduced by Reny (Econometrica 67(5):1029-1056, 1999) and refined by McLennan et al. (Econometrica 79(5):1643-1664, 2011), which leads to the existence of an equilibrium. We furthermore show that the equilibrium is essentially unique, and analyze its efficiency compared to a social optimum. We prove that the worst-case quality is unbounded. For identical leaders, we derive a closed-form expression for the efficiency of the equilibrium.