Stackelberg 博弈:对正则策略的应对
计算几何
2022-11-15 v1 离散数学
计算机科学与博弈论
理论经济学
最优化与控制
摘要
继 arXiv:2011.13275 中单轮 Voronoi 博弈的求解之后,我们自然可能想考虑基于点的竞争性布局及后续区域划分的类似博弈。为安抚 White(先手玩家)在可能被骗先行的点布局博弈中所流的眼泪,一种替代博弈(或更确切地说,Voronoi 博弈的扩展)是 Stackelberg 博弈:即便 Black(后手玩家)获得了争议区域的一半以上,也非全盘皆输。结果表明,大量结论可从单轮 Voronoi 博弈移植过来,而 Stackelberg 博弈尚待探索的是 White 如何最好地减轻 Black 布局所造成的损害。由于 arXiv:2011.13275 中已指出某些排布的重大弱点,我们将首先考虑仍满足这些结论的排布(即 White 采用某种网格排布),进而探讨 Black 如何最佳地利用这些位置。
引用
@article{arxiv.2211.06472,
title = {The Stackelberg Game: responses to regular strategies},
author = {Thomas Byrne},
journal= {arXiv preprint arXiv:2211.06472},
year = {2022}
}
备注
This document contains exclusively Chapter 5 of the author's PhD thesis titled 'Facility Location Problems and Games'. Besides the page numbering, the chapter is reproduced here in its entirety and appears identically to how it appears in the thesis. This document serves to act as a reference chapter