The Adversarial Stackelberg Value in Quantitative Games

04/27/2020
by   Emmanuel Filiot, et al.
0

In this paper, we study the notion of adversarial Stackelberg value for two-player non-zero sum games played on bi-weighted graphs with the mean-payoff and the discounted sum functions. The adversarial Stackelberg value of Player 0 is the largest value that Player 0 can obtain when announcing her strategy to Player 1 which in turn responds with any of his best response. For the mean-payoff function, we show that the adversarial Stackelberg value is not always achievable but epsilon-optimal strategies exist. We show how to compute this value and prove that the associated threshold problem is in NP. For the discounted sum payoff function, we draw a link with the target discounted sum problem which explains why the problem is difficult to solve for this payoff function. We also provide solutions to related gap problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/13/2020

Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower

Two-player Stackelberg games are non-zero sum strategic games between a ...
01/06/2021

On Satisficing in Quantitative Games

Several problems in planning and reactive synthesis can be reduced to th...
02/09/2018

Balancing Two-Player Stochastic Games with Soft Q-Learning

Within the context of video games the notion of perfectly rational agent...
07/02/2019

Energy mean-payoff games

In this paper, we study one-player and two-player energy mean-payoff gam...
12/03/2018

Symbolic Approximation of Weighted Timed Games

Weighted timed games are zero-sum games played by two players on a timed...
09/21/2022

The graph structure of two-player games

In this paper we analyse two-player games by their response graphs. The ...
03/05/2018

Playing Stackelberg Opinion Optimization with Randomized Algorithms for Combinatorial Strategies

From a perspective of designing or engineering for opinion formation gam...