DeepAI
Log In Sign Up

Stackelberg-Pareto Synthesis (Full Version)

02/17/2021
by   Véronique Bruyère, et al.
0

In this paper, we study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that is an optimal response. While it is usually assumed that Player 1 has a single objective, we consider here the new setting where he has several. In this context, after responding with his strategy, Player 1 gets a payoff in the form of a vector of Booleans corresponding to his satisfied objectives. Rationality of Player 1 is encoded by the fact that his response must produce a Pareto-optimal payoff given the strategy of Player 0. We study the Stackelberg-Pareto Synthesis problem which asks whether Player 0 can announce a strategy which satisfies his objective, whatever the rational response of Player 1. For games in which objectives are either all parity or all reachability objectives, we show that this problem is fixed-parameter tractable and NEXPTIME-complete. This problem is already NP-complete in the simple case of reachability objectives and graphs that are trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/02/2022

Stackelberg-Pareto Synthesis (Extended Version)

We study the framework of two-player Stackelberg games played on graphs ...
08/14/2019

Approximating Values of Generalized-Reachability Stochastic Games

Simple stochastic games are turn-based 2.5-player games with a reachabil...
02/27/2022

Pareto-Rational Verification

We study the rational verification problem which consists in verifying t...
05/27/2022

General Optimization Framework for Recurrent Reachability Objectives

We consider the mobile robot path planning problem for a class of recurr...
02/17/2020

Synthesis of Deceptive Strategies in Reachability Games with Action Misperception

We consider a class of two-player turn-based zero-sum games on graphs wi...
02/17/2020

Secure-by-synthesis network with active deception and temporal logic specifications

This paper is concerned with the synthesis of strategies in network syst...
07/21/2017

The Complexity of Concurrent Rational Synthesis

In this paper, we investigate the rational synthesis problem for concurr...