DeepAI
Log In Sign Up

Stackelberg-Pareto Synthesis (Extended Version)

03/02/2022
by   Véronique Bruyère, et al.
0

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 for several kinds of ω-regular objectives 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. We show that this problem is fixed-parameter tractable for games in which objectives are all reachability, safety, Büchi, co-Büchi, Boolean Büchi, parity, Muller, Streett or Rabin objectives. We also show that this problem is NEXPTIME-complete except for the cases of Büchi objectives for which it is NP-complete and co-Büchi objectives for which it is in NEXPTIME and NP-hard. The 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

02/17/2021

Stackelberg-Pareto Synthesis (Full Version)

In this paper, we study the framework of two-player Stackelberg games pl...
02/27/2022

Pareto-Rational Verification

We study the rational verification problem which consists in verifying t...
07/21/2017

The Complexity of Concurrent Rational Synthesis

In this paper, we investigate the rational synthesis problem for concurr...
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...
05/27/2022

General Optimization Framework for Recurrent Reachability Objectives

We consider the mobile robot path planning problem for a class of recurr...
07/19/2017

Parameterized complexity of games with monotonically ordered ω-regular objectives

In recent years, two-player zero-sum games with multiple objectives have...
10/18/2022

How to Play Optimally for Regular Objectives?

This paper studies two-player zero-sum games played on graphs and makes ...