Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been gaining attention, due to their application in various security and law enforcement scenarios. Earlier results consider the computation of optimal Stackelberg strategies, given that all the payoffs and the prior distribution over types are known. We extend these results in two different ways. First, we consider
optimal Stackelberg strategies. Our results here are mostly positive. Second, we consider computing
optimal Stackelberg strategies. Our results here are mostly negative.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten