容错Hotelling对策
Fault-Tolerant Hotelling Games
摘要:
$n$ -玩家Hotelling游戏要求每个玩家选择线段上的一个点,以最大化他的Voronoi单元的大小。本文研究了Hotelling对策的容错版本。研究了两种故障模型:线路故障和玩家故障。第一个模型假设环境是容易失败的:有一定的概率,断开发生在一个随机点上的线,分裂成两个单独的部分,并相应地修改每个球员的沃罗诺伊细胞。一个完整的表征纳什均衡的这种变体提供了每一个$n$。此外,一个一对一的对应关系之间的平衡,这个变种和霍特林游戏没有故障。第二个错误模型假设参与者容易失败:每个参与者都被i.i.d.从游戏中删除。概率,相应地改变剩余玩家的收益。结果表明,对于$n \geq 3$这个变种的游戏没有纳什均衡。
英文摘要:
The $n$-player Hotelling game calls for each player to choose a point on the line segment, so as to maximize the size of his Voronoi cell. This paper studies fault-tolerant versions of the Hotelling game. Two fault models are studied: line faults and player faults. The first model assumes that the environment is prone to failure: with some probability, a disconnection occurs at a random point on the line, splitting it into two separate segments and modifying each player's Voronoi cell accordingly. A complete characterization of the Nash equilibria of this variant is provided for every $n$. Additionally, a one to one correspondence is shown between equilibria of this variant and of the Hotelling game with no faults. The second fault model assumes the players are prone to failure: each player is removed from the game with i.i.d. probability, changing the payoffs of the remaining players accordingly. It is shown that for $n \geq 3$ this variant of the game has no Nash equilibria.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。